/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:44:22,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:44:22,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:44:22,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:44:22,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:44:22,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:44:22,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:44:22,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:44:22,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:44:22,710 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:44:22,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:44:22,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:44:22,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:44:22,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:44:22,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:44:22,715 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:44:22,715 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:44:22,716 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:44:22,718 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:44:22,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:44:22,721 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:44:22,722 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:44:22,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:44:22,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:44:22,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:44:22,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:44:22,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:44:22,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:44:22,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:44:22,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:44:22,729 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:44:22,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:44:22,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:44:22,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:44:22,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:44:22,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:44:22,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:44:22,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:44:22,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:44:22,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:44:22,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:44:22,735 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 12:44:22,749 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:44:22,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:44:22,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:44:22,751 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:44:22,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:44:22,751 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:44:22,751 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:44:22,752 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:44:22,752 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:44:22,752 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:44:22,752 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:44:22,752 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:44:22,752 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:44:22,753 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:44:22,753 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:44:22,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:44:22,753 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:44:22,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:44:22,754 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:44:22,754 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:44:22,754 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:44:22,754 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:44:22,754 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:44:22,754 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:44:22,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:44:22,755 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:44:22,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:44:22,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:44:22,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:44:22,919 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:44:22,933 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:44:22,936 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:44:22,937 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:44:22,938 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:44:22,939 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:44:23,744 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Cm2ecF/tmp/d4f475fbe405406e825e25bcc0748925/FLAG1ff490557 !SESSION 2020-07-01 12:44:20.498 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_Cm2ecF/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.cdt.core 1 0 2020-07-01 12:44:23.890 !MESSAGE Indexed 'FLAG1ff490557' (0 sources, 0 headers) in 0.003 sec: 0 declarations; 0 references; 0 unresolved inclusions; 0 syntax errors; 0 unresolved names (0%) [2020-07-01 12:44:24,101 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:44:24,102 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 12:44:24,102 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:44:24,109 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_Cm2ecF/tmp/d4f475fbe405406e825e25bcc0748925/FLAG1ff490557 [2020-07-01 12:44:24,531 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_Cm2ecF/tmp/d4f475fbe405406e825e25bcc0748925 [2020-07-01 12:44:24,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:44:24,544 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:44:24,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:44:24,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:44:24,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:44:24,550 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5211267e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24, skipping insertion in model container [2020-07-01 12:44:24,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:44:24,578 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:44:24,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:44:24,827 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:44:24,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:44:24,863 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:44:24,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24 WrapperNode [2020-07-01 12:44:24,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:44:24,864 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:44:24,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:44:24,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:44:24,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,884 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,907 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:44:24,907 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:44:24,907 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:44:24,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:44:24,917 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,919 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,920 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,929 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... [2020-07-01 12:44:24,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:44:24,933 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:44:24,933 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:44:24,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:44:24,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:44:25,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:44:25,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:44:25,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:44:25,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:44:25,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:44:25,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:44:25,347 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:44:25,347 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 12:44:25,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:25 BoogieIcfgContainer [2020-07-01 12:44:25,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:44:25,352 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:44:25,352 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:44:25,355 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:44:25,356 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:25" (1/1) ... [2020-07-01 12:44:25,374 INFO L313 BlockEncoder]: Initial Icfg 60 locations, 62 edges [2020-07-01 12:44:25,375 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:44:25,376 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:44:25,377 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:44:25,377 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:44:25,379 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:44:25,380 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:44:25,380 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:44:25,407 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:44:25,416 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2020-07-01 12:44:25,514 INFO L200 BlockEncoder]: SBE split 33 edges [2020-07-01 12:44:25,521 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 12:44:25,523 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:25,563 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:44:25,566 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 12:44:25,568 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:44:25,568 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:44:25,569 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:44:25,569 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:44:25,570 INFO L313 BlockEncoder]: Encoded RCFG 51 locations, 211 edges [2020-07-01 12:44:25,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:25 BasicIcfg [2020-07-01 12:44:25,571 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:44:25,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:44:25,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:44:25,576 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:44:25,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:44:24" (1/4) ... [2020-07-01 12:44:25,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100e1e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:44:25, skipping insertion in model container [2020-07-01 12:44:25,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (2/4) ... [2020-07-01 12:44:25,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100e1e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:44:25, skipping insertion in model container [2020-07-01 12:44:25,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:25" (3/4) ... [2020-07-01 12:44:25,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100e1e3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:25, skipping insertion in model container [2020-07-01 12:44:25,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:25" (4/4) ... [2020-07-01 12:44:25,580 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:44:25,590 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:44:25,598 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 30 error locations. [2020-07-01 12:44:25,613 INFO L251 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2020-07-01 12:44:25,637 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:44:25,637 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:44:25,638 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:44:25,638 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:44:25,638 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:44:25,638 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:44:25,638 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:44:25,638 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:44:25,655 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2020-07-01 12:44:25,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:25,662 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:25,662 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:25,663 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 138932, now seen corresponding path program 1 times [2020-07-01 12:44:25,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:25,679 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654122189] [2020-07-01 12:44:25,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:25,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654122189] [2020-07-01 12:44:25,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:25,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:25,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818059872] [2020-07-01 12:44:25,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:25,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:25,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:25,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:25,876 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-07-01 12:44:26,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,423 INFO L93 Difference]: Finished difference Result 100 states and 293 transitions. [2020-07-01 12:44:26,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:26,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,437 INFO L225 Difference]: With dead ends: 100 [2020-07-01 12:44:26,438 INFO L226 Difference]: Without dead ends: 51 [2020-07-01 12:44:26,442 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-01 12:44:26,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-07-01 12:44:26,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-01 12:44:26,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 84 transitions. [2020-07-01 12:44:26,484 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 84 transitions. Word has length 3 [2020-07-01 12:44:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,485 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 84 transitions. [2020-07-01 12:44:26,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,485 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 84 transitions. [2020-07-01 12:44:26,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:26,486 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:26,487 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:44:26,488 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,489 INFO L82 PathProgramCache]: Analyzing trace with hash 138622, now seen corresponding path program 1 times [2020-07-01 12:44:26,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683402005] [2020-07-01 12:44:26,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,583 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683402005] [2020-07-01 12:44:26,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634209198] [2020-07-01 12:44:26,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,587 INFO L87 Difference]: Start difference. First operand 51 states and 84 transitions. Second operand 3 states. [2020-07-01 12:44:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,740 INFO L93 Difference]: Finished difference Result 51 states and 84 transitions. [2020-07-01 12:44:26,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:26,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,742 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:44:26,743 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:44:26,744 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:44:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:44:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:44:26,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2020-07-01 12:44:26,750 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 76 transitions. Word has length 3 [2020-07-01 12:44:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,751 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 76 transitions. [2020-07-01 12:44:26,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 76 transitions. [2020-07-01 12:44:26,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:26,752 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,752 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:26,752 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:44:26,753 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,753 INFO L82 PathProgramCache]: Analyzing trace with hash 138624, now seen corresponding path program 1 times [2020-07-01 12:44:26,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47341358] [2020-07-01 12:44:26,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47341358] [2020-07-01 12:44:26,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262173596] [2020-07-01 12:44:26,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,796 INFO L87 Difference]: Start difference. First operand 47 states and 76 transitions. Second operand 3 states. [2020-07-01 12:44:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:26,875 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2020-07-01 12:44:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:26,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:26,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:26,876 INFO L225 Difference]: With dead ends: 51 [2020-07-01 12:44:26,876 INFO L226 Difference]: Without dead ends: 47 [2020-07-01 12:44:26,877 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-01 12:44:26,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-01 12:44:26,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-01 12:44:26,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 72 transitions. [2020-07-01 12:44:26,882 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 72 transitions. Word has length 3 [2020-07-01 12:44:26,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:26,883 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 72 transitions. [2020-07-01 12:44:26,883 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:26,883 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 72 transitions. [2020-07-01 12:44:26,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 12:44:26,883 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:26,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 12:44:26,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:44:26,884 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:26,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:26,884 INFO L82 PathProgramCache]: Analyzing trace with hash 138625, now seen corresponding path program 1 times [2020-07-01 12:44:26,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:26,885 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223278274] [2020-07-01 12:44:26,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:26,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223278274] [2020-07-01 12:44:26,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:26,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:26,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535700154] [2020-07-01 12:44:26,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:26,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:26,951 INFO L87 Difference]: Start difference. First operand 47 states and 72 transitions. Second operand 3 states. [2020-07-01 12:44:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,090 INFO L93 Difference]: Finished difference Result 47 states and 72 transitions. [2020-07-01 12:44:27,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 12:44:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,094 INFO L225 Difference]: With dead ends: 47 [2020-07-01 12:44:27,095 INFO L226 Difference]: Without dead ends: 43 [2020-07-01 12:44:27,095 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-01 12:44:27,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-07-01 12:44:27,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-01 12:44:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 68 transitions. [2020-07-01 12:44:27,100 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 68 transitions. Word has length 3 [2020-07-01 12:44:27,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,101 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 68 transitions. [2020-07-01 12:44:27,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 68 transitions. [2020-07-01 12:44:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:27,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,101 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:27,102 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:44:27,102 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 4291572, now seen corresponding path program 1 times [2020-07-01 12:44:27,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220181222] [2020-07-01 12:44:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,199 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220181222] [2020-07-01 12:44:27,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:27,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427742432] [2020-07-01 12:44:27,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:44:27,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:44:27,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:27,200 INFO L87 Difference]: Start difference. First operand 43 states and 68 transitions. Second operand 4 states. [2020-07-01 12:44:27,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,335 INFO L93 Difference]: Finished difference Result 43 states and 68 transitions. [2020-07-01 12:44:27,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 12:44:27,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,336 INFO L225 Difference]: With dead ends: 43 [2020-07-01 12:44:27,336 INFO L226 Difference]: Without dead ends: 42 [2020-07-01 12:44:27,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:27,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-01 12:44:27,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-07-01 12:44:27,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-01 12:44:27,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 66 transitions. [2020-07-01 12:44:27,342 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 66 transitions. Word has length 4 [2020-07-01 12:44:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,342 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 66 transitions. [2020-07-01 12:44:27,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:44:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 66 transitions. [2020-07-01 12:44:27,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 12:44:27,342 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,343 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 12:44:27,343 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:44:27,343 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,343 INFO L82 PathProgramCache]: Analyzing trace with hash 4291574, now seen corresponding path program 1 times [2020-07-01 12:44:27,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,344 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764499317] [2020-07-01 12:44:27,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764499317] [2020-07-01 12:44:27,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275176785] [2020-07-01 12:44:27,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,402 INFO L87 Difference]: Start difference. First operand 42 states and 66 transitions. Second operand 3 states. [2020-07-01 12:44:27,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,506 INFO L93 Difference]: Finished difference Result 42 states and 66 transitions. [2020-07-01 12:44:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 12:44:27,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,507 INFO L225 Difference]: With dead ends: 42 [2020-07-01 12:44:27,507 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 12:44:27,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 12:44:27,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 12:44:27,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 12:44:27,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-07-01 12:44:27,512 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 4 [2020-07-01 12:44:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,512 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-07-01 12:44:27,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-07-01 12:44:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:44:27,513 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,513 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:27,513 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 12:44:27,514 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,514 INFO L82 PathProgramCache]: Analyzing trace with hash 133040900, now seen corresponding path program 1 times [2020-07-01 12:44:27,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,514 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128332429] [2020-07-01 12:44:27,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,550 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128332429] [2020-07-01 12:44:27,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999928457] [2020-07-01 12:44:27,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,552 INFO L87 Difference]: Start difference. First operand 41 states and 64 transitions. Second operand 3 states. [2020-07-01 12:44:27,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,636 INFO L93 Difference]: Finished difference Result 41 states and 64 transitions. [2020-07-01 12:44:27,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,637 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:44:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,637 INFO L225 Difference]: With dead ends: 41 [2020-07-01 12:44:27,638 INFO L226 Difference]: Without dead ends: 37 [2020-07-01 12:44:27,638 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-01 12:44:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-07-01 12:44:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-01 12:44:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 56 transitions. [2020-07-01 12:44:27,642 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 56 transitions. Word has length 5 [2020-07-01 12:44:27,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,642 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 56 transitions. [2020-07-01 12:44:27,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,642 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 56 transitions. [2020-07-01 12:44:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 12:44:27,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,643 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 12:44:27,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 12:44:27,643 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash 133040902, now seen corresponding path program 1 times [2020-07-01 12:44:27,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,644 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868127664] [2020-07-01 12:44:27,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,688 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868127664] [2020-07-01 12:44:27,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077472299] [2020-07-01 12:44:27,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,690 INFO L87 Difference]: Start difference. First operand 37 states and 56 transitions. Second operand 3 states. [2020-07-01 12:44:27,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,777 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2020-07-01 12:44:27,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 12:44:27,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,779 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:44:27,779 INFO L226 Difference]: Without dead ends: 33 [2020-07-01 12:44:27,779 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-01 12:44:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2020-07-01 12:44:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-01 12:44:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2020-07-01 12:44:27,783 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 5 [2020-07-01 12:44:27,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,783 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2020-07-01 12:44:27,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2020-07-01 12:44:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:44:27,784 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,784 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:44:27,784 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -170704757, now seen corresponding path program 1 times [2020-07-01 12:44:27,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,785 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797663259] [2020-07-01 12:44:27,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,842 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797663259] [2020-07-01 12:44:27,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:27,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134573941] [2020-07-01 12:44:27,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:44:27,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:44:27,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:27,844 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand 4 states. [2020-07-01 12:44:27,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:27,916 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2020-07-01 12:44:27,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:27,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2020-07-01 12:44:27,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:27,917 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:44:27,917 INFO L226 Difference]: Without dead ends: 32 [2020-07-01 12:44:27,918 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:44:27,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-07-01 12:44:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-07-01 12:44:27,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-01 12:44:27,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2020-07-01 12:44:27,921 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 6 [2020-07-01 12:44:27,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:27,922 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 46 transitions. [2020-07-01 12:44:27,922 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:44:27,922 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 46 transitions. [2020-07-01 12:44:27,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 12:44:27,922 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:27,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 12:44:27,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-01 12:44:27,923 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:27,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:27,923 INFO L82 PathProgramCache]: Analyzing trace with hash -170704755, now seen corresponding path program 1 times [2020-07-01 12:44:27,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:27,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938467355] [2020-07-01 12:44:27,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:27,975 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938467355] [2020-07-01 12:44:27,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:27,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:27,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048078283] [2020-07-01 12:44:27,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:27,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:27,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:27,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:27,977 INFO L87 Difference]: Start difference. First operand 32 states and 46 transitions. Second operand 3 states. [2020-07-01 12:44:28,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,053 INFO L93 Difference]: Finished difference Result 32 states and 46 transitions. [2020-07-01 12:44:28,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 12:44:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,054 INFO L225 Difference]: With dead ends: 32 [2020-07-01 12:44:28,054 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 12:44:28,055 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 12:44:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 12:44:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 12:44:28,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2020-07-01 12:44:28,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 6 [2020-07-01 12:44:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,058 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2020-07-01 12:44:28,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2020-07-01 12:44:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:44:28,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-01 12:44:28,059 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,060 INFO L82 PathProgramCache]: Analyzing trace with hash -996878212, now seen corresponding path program 1 times [2020-07-01 12:44:28,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,060 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767495493] [2020-07-01 12:44:28,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,092 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767495493] [2020-07-01 12:44:28,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329634382] [2020-07-01 12:44:28,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,094 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 3 states. [2020-07-01 12:44:28,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,159 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2020-07-01 12:44:28,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:44:28,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,160 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:44:28,160 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:44:28,161 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:44:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:44:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:44:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-01 12:44:28,164 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 7 [2020-07-01 12:44:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,164 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-01 12:44:28,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-01 12:44:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:44:28,165 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,165 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-01 12:44:28,165 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,166 INFO L82 PathProgramCache]: Analyzing trace with hash -996878210, now seen corresponding path program 1 times [2020-07-01 12:44:28,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,166 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752644602] [2020-07-01 12:44:28,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,191 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752644602] [2020-07-01 12:44:28,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474331254] [2020-07-01 12:44:28,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,192 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 3 states. [2020-07-01 12:44:28,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,226 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2020-07-01 12:44:28,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:44:28,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,227 INFO L225 Difference]: With dead ends: 31 [2020-07-01 12:44:28,227 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 12:44:28,228 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 12:44:28,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 12:44:28,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 12:44:28,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-07-01 12:44:28,231 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 7 [2020-07-01 12:44:28,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,231 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 12:44:28,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-07-01 12:44:28,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:44:28,232 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,232 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,232 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-01 12:44:28,232 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,232 INFO L82 PathProgramCache]: Analyzing trace with hash -996878209, now seen corresponding path program 1 times [2020-07-01 12:44:28,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382012449] [2020-07-01 12:44:28,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,263 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382012449] [2020-07-01 12:44:28,263 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181227137] [2020-07-01 12:44:28,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,265 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 3 states. [2020-07-01 12:44:28,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,318 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2020-07-01 12:44:28,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:44:28,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,319 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:44:28,319 INFO L226 Difference]: Without dead ends: 25 [2020-07-01 12:44:28,320 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-01 12:44:28,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-01 12:44:28,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-01 12:44:28,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2020-07-01 12:44:28,322 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 7 [2020-07-01 12:44:28,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,323 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2020-07-01 12:44:28,323 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,323 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2020-07-01 12:44:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:44:28,323 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,324 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,324 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-01 12:44:28,324 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,324 INFO L82 PathProgramCache]: Analyzing trace with hash -222424900, now seen corresponding path program 1 times [2020-07-01 12:44:28,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863951045] [2020-07-01 12:44:28,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863951045] [2020-07-01 12:44:28,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684591389] [2020-07-01 12:44:28,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,360 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand 3 states. [2020-07-01 12:44:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,406 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2020-07-01 12:44:28,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:44:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,407 INFO L225 Difference]: With dead ends: 25 [2020-07-01 12:44:28,408 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:44:28,408 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:44:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-01 12:44:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:44:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-07-01 12:44:28,411 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 9 [2020-07-01 12:44:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,411 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-01 12:44:28,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2020-07-01 12:44:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 12:44:28,412 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,412 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-01 12:44:28,412 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash -222424898, now seen corresponding path program 1 times [2020-07-01 12:44:28,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,413 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184237823] [2020-07-01 12:44:28,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,455 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184237823] [2020-07-01 12:44:28,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139115167] [2020-07-01 12:44:28,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,456 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 3 states. [2020-07-01 12:44:28,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,501 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-01 12:44:28,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-07-01 12:44:28,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,503 INFO L225 Difference]: With dead ends: 24 [2020-07-01 12:44:28,503 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:44:28,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:44:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:44:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:44:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-01 12:44:28,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 9 [2020-07-01 12:44:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,507 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:44:28,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-01 12:44:28,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:44:28,507 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-01 12:44:28,508 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1134113862, now seen corresponding path program 1 times [2020-07-01 12:44:28,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140454060] [2020-07-01 12:44:28,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,538 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140454060] [2020-07-01 12:44:28,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698056251] [2020-07-01 12:44:28,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,540 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 3 states. [2020-07-01 12:44:28,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,577 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-01 12:44:28,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 12:44:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,578 INFO L225 Difference]: With dead ends: 23 [2020-07-01 12:44:28,578 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 12:44:28,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 12:44:28,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 12:44:28,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 12:44:28,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2020-07-01 12:44:28,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 13 [2020-07-01 12:44:28,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,581 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2020-07-01 12:44:28,581 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,581 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2020-07-01 12:44:28,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:44:28,582 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:44:28,582 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,582 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-01 12:44:28,582 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr29REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr28REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 12:44:28,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1134113864, now seen corresponding path program 1 times [2020-07-01 12:44:28,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,583 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269773835] [2020-07-01 12:44:28,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269773835] [2020-07-01 12:44:28,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014321401] [2020-07-01 12:44:28,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:44:28,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,617 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 3 states. [2020-07-01 12:44:28,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:28,653 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2020-07-01 12:44:28,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:28,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-01 12:44:28,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:44:28,654 INFO L225 Difference]: With dead ends: 22 [2020-07-01 12:44:28,654 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:44:28,655 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:44:28,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:44:28,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:44:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:44:28,655 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2020-07-01 12:44:28,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:44:28,656 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:44:28,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:44:28,656 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:44:28,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:44:28,656 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-01 12:44:28,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:44:28,741 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L15-2(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L15-4(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L15-5(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L15-6(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,742 INFO L268 CegarLoopResult]: For program point L15-7(lines 15 19) no Hoare annotation was computed. [2020-07-01 12:44:28,743 INFO L264 CegarLoopResult]: At program point L15-9(lines 13 19) the Hoare annotation is: (and (= 0 ULTIMATE.start_main_~b~0.offset) (= (select |#length| ULTIMATE.start_main_~M~0.base) 4) (= 0 ULTIMATE.start_main_~i~0.offset) (= 4 (select |#length| ULTIMATE.start_main_~c~0.base)) (= 0 ULTIMATE.start_main_~j~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~a~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~N~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~N~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~b~0.base)) (<= 1 |#StackHeapBarrier|) (= 0 ULTIMATE.start_main_~c~0.offset) (= 0 ULTIMATE.start_main_~a~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~j~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~i~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~i~0.base)) (= (select |#valid| ULTIMATE.start_main_~b~0.base) 1) (= (select |#length| ULTIMATE.start_main_~j~0.base) 4) (= 0 ULTIMATE.start_main_~N~0.offset) (= 0 ULTIMATE.start_main_~M~0.offset) (= 1 (select |#valid| ULTIMATE.start_main_~M~0.base)) (= 1 (select |#valid| ULTIMATE.start_main_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_main_~a~0.base))) [2020-07-01 12:44:28,743 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr29REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:44:28,743 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:28,743 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 12:44:28,743 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:44:28,743 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:44:28,743 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 12:44:28,744 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 12:44:28,745 INFO L268 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr28REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 12:44:28,746 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 12:44:28,747 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 12:44:28,750 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:44:28,761 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,762 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,763 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,770 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:28,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,771 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,772 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:28,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:28 BasicIcfg [2020-07-01 12:44:28,774 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:44:28,775 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:44:28,775 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:44:28,778 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:44:28,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:28,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:44:24" (1/5) ... [2020-07-01 12:44:28,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@446e738e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:44:28, skipping insertion in model container [2020-07-01 12:44:28,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:28,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:44:24" (2/5) ... [2020-07-01 12:44:28,780 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@446e738e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:44:28, skipping insertion in model container [2020-07-01 12:44:28,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:28,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:44:25" (3/5) ... [2020-07-01 12:44:28,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@446e738e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:44:28, skipping insertion in model container [2020-07-01 12:44:28,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:28,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:44:25" (4/5) ... [2020-07-01 12:44:28,781 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@446e738e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:44:28, skipping insertion in model container [2020-07-01 12:44:28,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:44:28,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:44:28" (5/5) ... [2020-07-01 12:44:28,783 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:44:28,804 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:44:28,804 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:44:28,804 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:44:28,805 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:44:28,805 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:44:28,805 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:44:28,805 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:44:28,805 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:44:28,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-07-01 12:44:28,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:44:28,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:44:28,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:44:28,822 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,822 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,822 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:44:28,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states. [2020-07-01 12:44:28,825 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-07-01 12:44:28,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:44:28,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:44:28,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:44:28,832 INFO L794 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue [105] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 12#L-1true [255] L-1-->L11: Formula: (let ((.cse5 (store |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (let ((.cse3 (store .cse5 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1))) (let ((.cse2 (store .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1| 1))) (let ((.cse4 (store .cse2 |v_ULTIMATE.start_main_#t~malloc3.base_1| 1))) (let ((.cse1 (store .cse4 |v_ULTIMATE.start_main_#t~malloc4.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_1| 1))) (and (= 0 (select |v_#valid_10| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~a~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_1|)) (= v_ULTIMATE.start_main_~c~0.base_1 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (= v_ULTIMATE.start_main_~i~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~N~0.offset_1 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (= (select .cse1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) 0) (= 0 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc5.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= (store (store (store (store (store (store (store |v_#length_8| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_ULTIMATE.start_main_#t~malloc2.base_1| 4) |v_ULTIMATE.start_main_#t~malloc3.base_1| 4) |v_ULTIMATE.start_main_#t~malloc4.base_1| 4) |v_ULTIMATE.start_main_#t~malloc5.base_1| 4) |v_ULTIMATE.start_main_#t~malloc6.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~b~0.base_1 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc4.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc4.base_1|) (< 0 |v_ULTIMATE.start_main_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 (select .cse2 |v_ULTIMATE.start_main_#t~malloc3.base_1|)) (= v_ULTIMATE.start_main_~j~0.offset_1 |v_ULTIMATE.start_main_#t~malloc3.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc6.offset_1|) (= v_ULTIMATE.start_main_~j~0.base_1 |v_ULTIMATE.start_main_#t~malloc3.base_1|) (= v_ULTIMATE.start_main_~N~0.base_1 |v_ULTIMATE.start_main_#t~malloc6.base_1|) (= 0 (select .cse3 |v_ULTIMATE.start_main_#t~malloc2.base_1|)) (= 0 (select .cse4 |v_ULTIMATE.start_main_#t~malloc4.base_1|)) (= 0 (select .cse5 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc5.base_1|) (= v_ULTIMATE.start_main_~i~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= v_ULTIMATE.start_main_~b~0.offset_1 |v_ULTIMATE.start_main_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~c~0.offset_1 |v_ULTIMATE.start_main_#t~malloc4.offset_1|) (= v_ULTIMATE.start_main_~M~0.base_1 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc6.base_1| 1)) (< 0 |v_ULTIMATE.start_main_#t~malloc5.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc3.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc6.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= v_ULTIMATE.start_main_~M~0.offset_1 |v_ULTIMATE.start_main_#t~malloc5.offset_1|)))))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_8|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~malloc4.offset=|v_ULTIMATE.start_main_#t~malloc4.offset_1|, ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_1, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_1, ULTIMATE.start_main_~N~0.base=v_ULTIMATE.start_main_~N~0.base_1, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, ULTIMATE.start_main_#t~malloc2.base=|v_ULTIMATE.start_main_#t~malloc2.base_1|, ULTIMATE.start_main_#t~malloc3.base=|v_ULTIMATE.start_main_#t~malloc3.base_1|, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_1, ULTIMATE.start_main_#t~malloc6.offset=|v_ULTIMATE.start_main_#t~malloc6.offset_1|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_1|, #length=|v_#length_1|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_1|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_1|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_1|, ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_1, ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_1|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc6.base=|v_ULTIMATE.start_main_#t~malloc6.base_1|, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_1, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_1, ULTIMATE.start_main_#t~malloc4.base=|v_ULTIMATE.start_main_#t~malloc4.base_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~malloc5.base=|v_ULTIMATE.start_main_#t~malloc5.base_1|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_1, ULTIMATE.start_main_#t~malloc3.offset=|v_ULTIMATE.start_main_#t~malloc3.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_1, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_1, ULTIMATE.start_main_#t~malloc2.offset=|v_ULTIMATE.start_main_#t~malloc2.offset_1|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_1, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_~N~0.offset=v_ULTIMATE.start_main_~N~0.offset_1, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_1, ULTIMATE.start_main_#t~malloc5.offset=|v_ULTIMATE.start_main_#t~malloc5.offset_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc4.offset, ULTIMATE.start_main_~c~0.base, ULTIMATE.start_main_~i~0.base, ULTIMATE.start_main_~N~0.base, ULTIMATE.start_main_~c~0.offset, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~malloc2.base, ULTIMATE.start_main_#t~malloc3.base, ULTIMATE.start_main_~M~0.offset, ULTIMATE.start_main_#t~malloc6.offset, ULTIMATE.start_main_#t~short13, #length, ULTIMATE.start_main_#t~mem15, ULTIMATE.start_main_#t~mem14, ULTIMATE.start_main_#t~mem16, ULTIMATE.start_main_~i~0.offset, ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~malloc6.base, ULTIMATE.start_main_~b~0.offset, ULTIMATE.start_main_~M~0.base, ULTIMATE.start_main_#t~malloc4.base, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_#t~malloc5.base, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_main_#t~malloc3.offset, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_~j~0.offset, ULTIMATE.start_main_#t~mem8, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#t~malloc2.offset, ULTIMATE.start_main_~b~0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_~N~0.offset, ULTIMATE.start_main_~j~0.base, ULTIMATE.start_main_#t~malloc5.offset] 25#L11true [106] L11-->L11-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~i~0.offset_4 4) (select |v_#length_9| v_ULTIMATE.start_main_~i~0.base_4)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_4) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~i~0.base_4)) (= |v_ULTIMATE.start_main_#t~mem7_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~i~0.base_4) v_ULTIMATE.start_main_~i~0.offset_4))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, #memory_int=|v_#memory_int_1|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, #length=|v_#length_9|, #valid=|v_#valid_11|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_4, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_4, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_2|, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_1|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7] 22#L11-1true [364] L11-1-->L12: Formula: (and (= 1 (select |v_#valid_49| v_ULTIMATE.start_main_~a~0.base_7)) (<= (+ v_ULTIMATE.start_main_~a~0.offset_6 4) (select |v_#length_39| v_ULTIMATE.start_main_~a~0.base_7)) (= |v_#memory_int_22| (store |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7 (store (select |v_#memory_int_23| v_ULTIMATE.start_main_~a~0.base_7) v_ULTIMATE.start_main_~a~0.offset_6 |v_ULTIMATE.start_main_#t~mem7_6|))) (<= 0 v_ULTIMATE.start_main_~a~0.offset_6)) InVars {ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_6|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_23|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} OutVars{ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_6, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_39|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem7, #memory_int] 43#L12true [125] L12-->L12-1: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_main_~j~0.base_4)) (<= (+ v_ULTIMATE.start_main_~j~0.offset_4 4) (select |v_#length_13| v_ULTIMATE.start_main_~j~0.base_4)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_4) (= |v_ULTIMATE.start_main_#t~mem8_2| (select (select |v_#memory_int_4| v_ULTIMATE.start_main_~j~0.base_4) v_ULTIMATE.start_main_~j~0.offset_4))) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #length=|v_#length_13|, #valid=|v_#valid_15|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_2|, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_4, #valid=|v_#valid_15|, #memory_int=|v_#memory_int_4|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_4, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8] 42#L12-1true [365] L12-1-->L13: Formula: (and (= 1 (select |v_#valid_50| v_ULTIMATE.start_main_~b~0.base_7)) (<= 0 v_ULTIMATE.start_main_~b~0.offset_6) (<= (+ v_ULTIMATE.start_main_~b~0.offset_6 4) (select |v_#length_40| v_ULTIMATE.start_main_~b~0.base_7)) (= (store |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7 (store (select |v_#memory_int_25| v_ULTIMATE.start_main_~b~0.base_7) v_ULTIMATE.start_main_~b~0.offset_6 |v_ULTIMATE.start_main_#t~mem8_6|)) |v_#memory_int_24|)) InVars {ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_6|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_25|, #length=|v_#length_40|} OutVars{ULTIMATE.start_main_#t~mem8=|v_ULTIMATE.start_main_#t~mem8_5|, ULTIMATE.start_main_~b~0.base=v_ULTIMATE.start_main_~b~0.base_7, ULTIMATE.start_main_~b~0.offset=v_ULTIMATE.start_main_~b~0.offset_6, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_24|, #length=|v_#length_40|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem8, #memory_int] 52#L13true [136] L13-->L15-9: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~c~0.base_4) v_ULTIMATE.start_main_~c~0.offset_4 0))) (<= (+ v_ULTIMATE.start_main_~c~0.offset_4 4) (select |v_#length_17| v_ULTIMATE.start_main_~c~0.base_4)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~c~0.base_4)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_4)) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_8|, #length=|v_#length_17|, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_4, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_4, #memory_int=|v_#memory_int_7|, #length=|v_#length_17|, #valid=|v_#valid_19|} AuxVars[] AssignedVars[#memory_int] 6#L15-9true [2020-07-01 12:44:28,833 INFO L796 eck$LassoCheckResult]: Loop: 6#L15-9true [80] L15-9-->L15: Formula: (and (= 1 (select |v_#valid_21| v_ULTIMATE.start_main_~i~0.base_7)) (= (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~i~0.base_7) v_ULTIMATE.start_main_~i~0.offset_6) |v_ULTIMATE.start_main_#t~mem9_2|) (<= (+ v_ULTIMATE.start_main_~i~0.offset_6 4) (select |v_#length_19| v_ULTIMATE.start_main_~i~0.base_7)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_6)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #length=|v_#length_19|, #valid=|v_#valid_21|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_6, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_2|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_7, #valid=|v_#valid_21|, #memory_int=|v_#memory_int_9|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem9] 18#L15true [96] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~M~0.offset_4) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~M~0.base_4)) (= (select (select |v_#memory_int_10| v_ULTIMATE.start_main_~M~0.base_4) v_ULTIMATE.start_main_~M~0.offset_4) |v_ULTIMATE.start_main_#t~mem10_2|) (<= (+ v_ULTIMATE.start_main_~M~0.offset_4 4) (select |v_#length_21| v_ULTIMATE.start_main_~M~0.base_4))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_21|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_2|, ULTIMATE.start_main_~M~0.base=v_ULTIMATE.start_main_~M~0.base_4, ULTIMATE.start_main_~M~0.offset=v_ULTIMATE.start_main_~M~0.offset_4, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10] 30#L15-1true [328] L15-1-->L15-2: Formula: (and (>= |v_ULTIMATE.start_main_#t~mem9_3| |v_ULTIMATE.start_main_#t~mem10_3|) (not |v_ULTIMATE.start_main_#t~short13_2|)) InVars {ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_3|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_3|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short13] 29#L15-2true [112] L15-2-->L15-7: Formula: |v_ULTIMATE.start_main_#t~short13_3| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} OutVars{ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_3|} AuxVars[] AssignedVars[] 9#L15-7true [90] L15-7-->L16: Formula: |v_ULTIMATE.start_main_#t~short13_9| InVars {ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_9|} OutVars{ULTIMATE.start_main_#t~mem10=|v_ULTIMATE.start_main_#t~mem10_5|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_5|, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, ULTIMATE.start_main_#t~short13=|v_ULTIMATE.start_main_#t~short13_8|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem10, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~short13] 33#L16true [118] L16-->L16-1: Formula: (and (= |v_ULTIMATE.start_main_#t~mem14_2| (select (select |v_#memory_int_13| v_ULTIMATE.start_main_~i~0.base_10) v_ULTIMATE.start_main_~i~0.offset_8)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_8) (= 1 (select |v_#valid_29| v_ULTIMATE.start_main_~i~0.base_10)) (<= (+ v_ULTIMATE.start_main_~i~0.offset_8 4) (select |v_#length_27| v_ULTIMATE.start_main_~i~0.base_10))) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #length=|v_#length_27|, #valid=|v_#valid_29|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_8, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_10, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_27|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem14] 32#L16-1true [369] L16-1-->L17: Formula: (and (= 1 (select |v_#valid_57| v_ULTIMATE.start_main_~i~0.base_16)) (<= 0 v_ULTIMATE.start_main_~i~0.offset_12) (<= (+ v_ULTIMATE.start_main_~i~0.offset_12 4) (select |v_#length_41| v_ULTIMATE.start_main_~i~0.base_16)) (= (store |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~i~0.base_16) v_ULTIMATE.start_main_~i~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem14_6| 1))) |v_#memory_int_26|)) InVars {ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_27|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_6|} OutVars{ULTIMATE.start_main_~i~0.offset=v_ULTIMATE.start_main_~i~0.offset_12, ULTIMATE.start_main_~i~0.base=v_ULTIMATE.start_main_~i~0.base_16, #valid=|v_#valid_57|, #memory_int=|v_#memory_int_26|, #length=|v_#length_41|, ULTIMATE.start_main_#t~mem14=|v_ULTIMATE.start_main_#t~mem14_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem14] 48#L17true [133] L17-->L17-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~j~0.offset_8 4) (select |v_#length_31| v_ULTIMATE.start_main_~j~0.base_10)) (<= 0 v_ULTIMATE.start_main_~j~0.offset_8) (= 1 (select |v_#valid_33| v_ULTIMATE.start_main_~j~0.base_10)) (= |v_ULTIMATE.start_main_#t~mem15_2| (select (select |v_#memory_int_16| v_ULTIMATE.start_main_~j~0.base_10) v_ULTIMATE.start_main_~j~0.offset_8))) InVars {#memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #length=|v_#length_31|, #valid=|v_#valid_33|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_8, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_16|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_10, #length=|v_#length_31|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem15] 46#L17-1true [370] L17-1-->L18: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16 (store (select |v_#memory_int_29| v_ULTIMATE.start_main_~j~0.base_16) v_ULTIMATE.start_main_~j~0.offset_12 (+ |v_ULTIMATE.start_main_#t~mem15_6| 1))) |v_#memory_int_28|) (<= 0 v_ULTIMATE.start_main_~j~0.offset_12) (<= (+ v_ULTIMATE.start_main_~j~0.offset_12 4) (select |v_#length_42| v_ULTIMATE.start_main_~j~0.base_16)) (= 1 (select |v_#valid_58| v_ULTIMATE.start_main_~j~0.base_16))) InVars {ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_6|} OutVars{ULTIMATE.start_main_~j~0.offset=v_ULTIMATE.start_main_~j~0.offset_12, #valid=|v_#valid_58|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_main_~j~0.base=v_ULTIMATE.start_main_~j~0.base_16, #length=|v_#length_42|, ULTIMATE.start_main_#t~mem15=|v_ULTIMATE.start_main_#t~mem15_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem15] 8#L18true [86] L18-->L18-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~c~0.offset_6 4) (select |v_#length_35| v_ULTIMATE.start_main_~c~0.base_7)) (<= 0 v_ULTIMATE.start_main_~c~0.offset_6) (= (select |v_#valid_37| v_ULTIMATE.start_main_~c~0.base_7) 1) (= |v_ULTIMATE.start_main_#t~mem16_2| (select (select |v_#memory_int_19| v_ULTIMATE.start_main_~c~0.base_7) v_ULTIMATE.start_main_~c~0.offset_6))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, #valid=|v_#valid_37|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_7, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_6, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_19|, #length=|v_#length_35|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem16] 7#L18-1true [371] L18-1-->L15-9: Formula: (and (= (store |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13 (store (select |v_#memory_int_31| v_ULTIMATE.start_main_~c~0.base_13) v_ULTIMATE.start_main_~c~0.offset_10 (+ |v_ULTIMATE.start_main_#t~mem16_6| 1))) |v_#memory_int_30|) (<= 0 v_ULTIMATE.start_main_~c~0.offset_10) (= 1 (select |v_#valid_59| v_ULTIMATE.start_main_~c~0.base_13)) (<= (+ v_ULTIMATE.start_main_~c~0.offset_10 4) (select |v_#length_43| v_ULTIMATE.start_main_~c~0.base_13))) InVars {ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_31|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_6|} OutVars{ULTIMATE.start_main_~c~0.base=v_ULTIMATE.start_main_~c~0.base_13, ULTIMATE.start_main_~c~0.offset=v_ULTIMATE.start_main_~c~0.offset_10, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_30|, #length=|v_#length_43|, ULTIMATE.start_main_#t~mem16=|v_ULTIMATE.start_main_#t~mem16_5|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~mem16] 6#L15-9true [2020-07-01 12:44:28,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,834 INFO L82 PathProgramCache]: Analyzing trace with hash -739216033, now seen corresponding path program 1 times [2020-07-01 12:44:28,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,835 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900986515] [2020-07-01 12:44:28,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,855 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900986515] [2020-07-01 12:44:28,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:44:28,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651407] [2020-07-01 12:44:28,857 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:44:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:44:28,857 INFO L82 PathProgramCache]: Analyzing trace with hash 197412198, now seen corresponding path program 1 times [2020-07-01 12:44:28,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:44:28,858 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754283425] [2020-07-01 12:44:28,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:44:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:44:28,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:44:28,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754283425] [2020-07-01 12:44:28,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:44:28,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:44:28,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892816145] [2020-07-01 12:44:28,872 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 12:44:28,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:44:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:44:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:44:28,874 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2020-07-01 12:44:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:44:29,283 INFO L93 Difference]: Finished difference Result 51 states and 84 transitions. [2020-07-01 12:44:29,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:44:29,287 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 12:44:29,292 INFO L168 Benchmark]: Toolchain (without parser) took 4746.97 ms. Allocated memory was 649.6 MB in the beginning and 760.2 MB in the end (delta: 110.6 MB). Free memory was 561.6 MB in the beginning and 380.9 MB in the end (delta: 180.6 MB). Peak memory consumption was 291.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,292 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:44:29,293 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.80 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 561.6 MB in the beginning and 652.1 MB in the end (delta: -90.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,293 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.82 ms. Allocated memory is still 688.4 MB. Free memory was 652.1 MB in the beginning and 649.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,293 INFO L168 Benchmark]: Boogie Preprocessor took 25.56 ms. Allocated memory is still 688.4 MB. Free memory was 649.8 MB in the beginning and 647.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,294 INFO L168 Benchmark]: RCFGBuilder took 418.63 ms. Allocated memory is still 688.4 MB. Free memory was 647.6 MB in the beginning and 616.7 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,294 INFO L168 Benchmark]: BlockEncodingV2 took 218.92 ms. Allocated memory is still 688.4 MB. Free memory was 616.7 MB in the beginning and 583.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,295 INFO L168 Benchmark]: TraceAbstraction took 3202.01 ms. Allocated memory was 688.4 MB in the beginning and 760.2 MB in the end (delta: 71.8 MB). Free memory was 582.2 MB in the beginning and 471.3 MB in the end (delta: 110.9 MB). Peak memory consumption was 182.8 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,295 INFO L168 Benchmark]: BuchiAutomizer took 514.25 ms. Allocated memory is still 760.2 MB. Free memory was 471.3 MB in the beginning and 380.9 MB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 50.3 GB. [2020-07-01 12:44:29,298 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 60 locations, 62 edges - StatisticsResult: Encoded RCFG 51 locations, 211 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 318.80 ms. Allocated memory was 649.6 MB in the beginning and 688.4 MB in the end (delta: 38.8 MB). Free memory was 561.6 MB in the beginning and 652.1 MB in the end (delta: -90.5 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 42.82 ms. Allocated memory is still 688.4 MB. Free memory was 652.1 MB in the beginning and 649.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 25.56 ms. Allocated memory is still 688.4 MB. Free memory was 649.8 MB in the beginning and 647.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 50.3 GB. * RCFGBuilder took 418.63 ms. Allocated memory is still 688.4 MB. Free memory was 647.6 MB in the beginning and 616.7 MB in the end (delta: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 218.92 ms. Allocated memory is still 688.4 MB. Free memory was 616.7 MB in the beginning and 583.3 MB in the end (delta: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 3202.01 ms. Allocated memory was 688.4 MB in the beginning and 760.2 MB in the end (delta: 71.8 MB). Free memory was 582.2 MB in the beginning and 471.3 MB in the end (delta: 110.9 MB). Peak memory consumption was 182.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 514.25 ms. Allocated memory is still 760.2 MB. Free memory was 471.3 MB in the beginning and 380.9 MB in the end (delta: 90.4 MB). Peak memory consumption was 90.4 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant [2020-07-01 12:44:29,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,309 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:29,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,310 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,312 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:44:29,313 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:44:29,314 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((((((((((((0 == b && unknown-#length-unknown[M] == 4) && 0 == i) && 4 == unknown-#length-unknown[c]) && 0 == j) && 1 == \valid[a]) && 1 == \valid[N]) && 4 == unknown-#length-unknown[N]) && 4 == unknown-#length-unknown[b]) && 1 <= unknown-#StackHeapBarrier-unknown) && 0 == c) && 0 == a) && 1 == \valid[j]) && 1 == \valid[i]) && 4 == unknown-#length-unknown[i]) && \valid[b] == 1) && unknown-#length-unknown[j] == 4) && 0 == N) && 0 == M) && 1 == \valid[M]) && 1 == \valid[c]) && 4 == unknown-#length-unknown[a] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 30 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 106 SDtfs, 856 SDslu, 9 SDs, 0 SdLazy, 738 SolverSat, 172 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 95 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 3876 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:44:29.549 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check