./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/toy1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/systemc/toy1.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:03:50,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:03:50,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:03:50,163 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:03:50,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:03:50,165 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:03:50,166 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:03:50,168 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:03:50,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:03:50,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:03:50,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:03:50,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:03:50,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:03:50,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:03:50,175 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:03:50,176 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:03:50,177 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:03:50,178 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:03:50,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:03:50,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:03:50,184 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:03:50,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:03:50,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:03:50,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:03:50,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:03:50,190 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:03:50,190 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:03:50,191 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:03:50,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:03:50,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:03:50,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:03:50,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:03:50,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:03:50,195 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:03:50,196 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:03:50,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:03:50,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:03:50,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:03:50,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:03:50,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:03:50,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:03:50,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 08:03:50,244 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:03:50,245 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:03:50,246 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:03:50,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:03:50,247 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:03:50,247 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:03:50,247 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:03:50,247 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:03:50,248 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:03:50,248 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:03:50,248 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:03:50,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:03:50,249 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:03:50,249 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:03:50,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:03:50,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:03:50,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:03:50,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:03:50,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:03:50,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:03:50,251 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:03:50,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:03:50,251 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:03:50,251 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:03:50,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:03:50,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:03:50,252 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:03:50,252 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:03:50,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:03:50,253 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:03:50,253 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:03:50,254 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:03:50,255 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:03:50,255 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f4cd6a09c2ca92f0964bf6dcd7808d358e7e20e1 [2020-10-20 08:03:50,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:03:50,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:03:50,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:03:50,493 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:03:50,493 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:03:50,494 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/toy1.cil.c [2020-10-20 08:03:50,575 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac361d0f/e68a152902fe4a1681e84f59b2d060f3/FLAG342c76f2e [2020-10-20 08:03:51,131 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:03:51,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/toy1.cil.c [2020-10-20 08:03:51,154 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac361d0f/e68a152902fe4a1681e84f59b2d060f3/FLAG342c76f2e [2020-10-20 08:03:51,432 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ac361d0f/e68a152902fe4a1681e84f59b2d060f3 [2020-10-20 08:03:51,436 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:03:51,443 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:03:51,444 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:03:51,444 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:03:51,449 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:03:51,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:51,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e8b3826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51, skipping insertion in model container [2020-10-20 08:03:51,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:51,469 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:03:51,535 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:03:51,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:03:51,869 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:03:51,947 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:03:51,967 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:03:51,967 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51 WrapperNode [2020-10-20 08:03:51,968 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:03:51,969 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:03:51,969 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:03:51,969 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:03:51,978 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:51,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:03:52,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:03:52,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:03:52,024 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:03:52,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... [2020-10-20 08:03:52,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:03:52,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:03:52,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:03:52,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:03:52,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:52,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:03:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:03:52,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:03:52,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:03:52,804 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:03:52,808 INFO L298 CfgBuilder]: Removed 32 assume(true) statements. [2020-10-20 08:03:52,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:52 BoogieIcfgContainer [2020-10-20 08:03:52,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:03:52,823 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:03:52,823 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:03:52,829 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:03:52,830 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:52,831 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:03:51" (1/3) ... [2020-10-20 08:03:52,832 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25b63a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:03:52, skipping insertion in model container [2020-10-20 08:03:52,833 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:52,833 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:03:51" (2/3) ... [2020-10-20 08:03:52,834 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25b63a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:03:52, skipping insertion in model container [2020-10-20 08:03:52,834 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:03:52,834 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:52" (3/3) ... [2020-10-20 08:03:52,838 INFO L373 chiAutomizerObserver]: Analyzing ICFG toy1.cil.c [2020-10-20 08:03:52,898 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:03:52,899 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:03:52,899 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:03:52,899 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:03:52,900 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:03:52,900 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:03:52,900 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:03:52,900 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:03:52,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2020-10-20 08:03:52,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-10-20 08:03:52,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:52,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:53,008 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,009 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,009 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:03:53,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states. [2020-10-20 08:03:53,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2020-10-20 08:03:53,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:53,030 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:53,032 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,033 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,045 INFO L794 eck$LassoCheckResult]: Stem: 103#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 13#L-1true havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 58#L408true assume !(1 == ~c_req_up~0); 62#L408-2true assume !(1 == ~wl_i~0);~wl_st~0 := 2; 60#L419-1true assume !(1 == ~c1_i~0);~c1_st~0 := 2; 84#L424-1true assume 1 == ~c2_i~0;~c2_st~0 := 0; 112#L429-1true assume !(1 == ~wb_i~0);~wb_st~0 := 2; 131#L434-1true assume !(1 == ~r_i~0);~r_st~0 := 2; 30#L439-1true assume !(0 == ~e_f~0); 54#L444-1true assume !(0 == ~e_g~0); 81#L449-1true assume !(0 == ~e_e~0); 108#L454-1true assume !(0 == ~e_c~0); 129#L459-1true assume !(0 == ~e_wl~0); 24#L464-1true assume !(1 == ~wl_pc~0); 107#L476true assume !(2 == ~wl_pc~0); 53#L477true assume !(1 == ~c1_pc~0); 105#L487true assume !(1 == ~c2_pc~0); 74#L496true assume !(1 == ~wb_pc~0); 26#L505true assume !(1 == ~e_c~0); 126#L514-1true assume !(1 == ~e_e~0); 21#L519-1true assume !(1 == ~e_f~0); 48#L524-1true assume !(1 == ~e_g~0); 75#L529-1true assume !(1 == ~e_c~0); 98#L534-1true assume !(1 == ~e_wl~0); 6#L676-1true [2020-10-20 08:03:53,048 INFO L796 eck$LassoCheckResult]: Loop: 6#L676-1true assume !false; 45#L546true start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 35#L381true assume !true; 59#L397true start_simulation_~kernel_st~0 := 2; 18#L552true assume !(1 == ~c_req_up~0); 22#L552-2true start_simulation_~kernel_st~0 := 3; 100#L564true assume 0 == ~e_f~0;~e_f~0 := 1; 104#L564-2true assume 0 == ~e_g~0;~e_g~0 := 1; 124#L569-1true assume 0 == ~e_e~0;~e_e~0 := 1; 19#L574-1true assume 0 == ~e_c~0;~e_c~0 := 1; 46#L579-1true assume 0 == ~e_wl~0;~e_wl~0 := 1; 72#L584-1true assume 1 == ~wl_pc~0; 42#L590true assume 1 == ~e_wl~0;~wl_st~0 := 0; 117#L597true assume !(1 == ~c1_pc~0); 32#L607true assume !(1 == ~c2_pc~0); 119#L616true assume !(1 == ~wb_pc~0); 87#L625true assume 1 == ~e_c~0;~r_st~0 := 0; 41#L634-1true assume 1 == ~e_e~0;~e_e~0 := 2; 68#L639-1true assume 1 == ~e_f~0;~e_f~0 := 2; 94#L644-1true assume 1 == ~e_g~0;~e_g~0 := 2; 120#L649-1true assume 1 == ~e_c~0;~e_c~0 := 2; 8#L654-1true assume 1 == ~e_wl~0;~e_wl~0 := 2; 38#L659-1true assume 0 == ~wl_st~0; 6#L676-1true [2020-10-20 08:03:53,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:53,059 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 1 times [2020-10-20 08:03:53,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:53,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540742929] [2020-10-20 08:03:53,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:53,282 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540742929] [2020-10-20 08:03:53,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:53,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:53,284 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124405060] [2020-10-20 08:03:53,290 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:53,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:53,291 INFO L82 PathProgramCache]: Analyzing trace with hash -215395975, now seen corresponding path program 1 times [2020-10-20 08:03:53,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:53,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912423813] [2020-10-20 08:03:53,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:53,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:53,304 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912423813] [2020-10-20 08:03:53,304 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:53,304 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:53,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119680806] [2020-10-20 08:03:53,307 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:53,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:53,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 08:03:53,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 08:03:53,328 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 2 states. [2020-10-20 08:03:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:53,358 INFO L93 Difference]: Finished difference Result 127 states and 221 transitions. [2020-10-20 08:03:53,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:03:53,361 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 127 states and 221 transitions. [2020-10-20 08:03:53,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-20 08:03:53,370 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 127 states to 121 states and 215 transitions. [2020-10-20 08:03:53,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-10-20 08:03:53,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2020-10-20 08:03:53,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 215 transitions. [2020-10-20 08:03:53,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:53,375 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2020-10-20 08:03:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 215 transitions. [2020-10-20 08:03:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-20 08:03:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 08:03:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 215 transitions. [2020-10-20 08:03:53,420 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2020-10-20 08:03:53,420 INFO L594 BuchiCegarLoop]: Abstraction has 121 states and 215 transitions. [2020-10-20 08:03:53,420 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:03:53,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 215 transitions. [2020-10-20 08:03:53,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-20 08:03:53,422 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:53,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:53,424 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,424 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,425 INFO L794 eck$LassoCheckResult]: Stem: 379#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 285#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 286#L408 assume !(1 == ~c_req_up~0); 277#L408-2 assume !(1 == ~wl_i~0);~wl_st~0 := 2; 351#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 352#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 372#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 383#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 315#L439-1 assume !(0 == ~e_f~0); 316#L444-1 assume !(0 == ~e_g~0); 349#L449-1 assume !(0 == ~e_e~0); 369#L454-1 assume !(0 == ~e_c~0); 382#L459-1 assume !(0 == ~e_wl~0); 307#L464-1 assume !(1 == ~wl_pc~0); 308#L476 assume !(2 == ~wl_pc~0); 348#L477 assume !(1 == ~c1_pc~0); 345#L487 assume !(1 == ~c2_pc~0); 302#L496 assume !(1 == ~wb_pc~0); 310#L505 assume !(1 == ~e_c~0); 311#L514-1 assume !(1 == ~e_e~0); 303#L519-1 assume !(1 == ~e_f~0); 304#L524-1 assume !(1 == ~e_g~0); 341#L529-1 assume !(1 == ~e_c~0); 363#L534-1 assume !(1 == ~e_wl~0); 266#L676-1 [2020-10-20 08:03:53,425 INFO L796 eck$LassoCheckResult]: Loop: 266#L676-1 assume !false; 272#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 326#L381 assume !false; 293#L299 assume !(0 == ~wl_st~0); 295#L303 assume !(0 == ~c1_st~0); 361#L306 assume !(0 == ~c2_st~0); 355#L309 assume !(0 == ~wb_st~0); 337#L312 assume !(0 == ~r_st~0); 338#L397 start_simulation_~kernel_st~0 := 2; 296#L552 assume !(1 == ~c_req_up~0); 298#L552-2 start_simulation_~kernel_st~0 := 3; 305#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 377#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 380#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 299#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 300#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 339#L584-1 assume !(1 == ~wl_pc~0); 288#L596 assume !(2 == ~wl_pc~0); 289#L597 assume !(1 == ~c1_pc~0); 320#L607 assume !(1 == ~c2_pc~0); 322#L616 assume !(1 == ~wb_pc~0); 330#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 331#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 332#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 356#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 375#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 275#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 276#L659-1 assume 0 == ~wl_st~0; 266#L676-1 [2020-10-20 08:03:53,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:53,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2133486251, now seen corresponding path program 2 times [2020-10-20 08:03:53,426 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:53,426 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421701337] [2020-10-20 08:03:53,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:53,477 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421701337] [2020-10-20 08:03:53,477 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:53,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:53,478 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8288184] [2020-10-20 08:03:53,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:53,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:53,479 INFO L82 PathProgramCache]: Analyzing trace with hash -744717060, now seen corresponding path program 1 times [2020-10-20 08:03:53,479 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:53,479 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967729632] [2020-10-20 08:03:53,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:53,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:53,525 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967729632] [2020-10-20 08:03:53,525 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:53,526 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:53,526 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083979159] [2020-10-20 08:03:53,526 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:53,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:53,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:53,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:53,527 INFO L87 Difference]: Start difference. First operand 121 states and 215 transitions. cyclomatic complexity: 95 Second operand 3 states. [2020-10-20 08:03:53,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:53,556 INFO L93 Difference]: Finished difference Result 121 states and 214 transitions. [2020-10-20 08:03:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:53,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 121 states and 214 transitions. [2020-10-20 08:03:53,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-20 08:03:53,562 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 121 states to 121 states and 214 transitions. [2020-10-20 08:03:53,562 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 121 [2020-10-20 08:03:53,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 121 [2020-10-20 08:03:53,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 121 states and 214 transitions. [2020-10-20 08:03:53,564 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:03:53,564 INFO L691 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2020-10-20 08:03:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 214 transitions. [2020-10-20 08:03:53,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-10-20 08:03:53,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-10-20 08:03:53,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 214 transitions. [2020-10-20 08:03:53,574 INFO L714 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2020-10-20 08:03:53,574 INFO L594 BuchiCegarLoop]: Abstraction has 121 states and 214 transitions. [2020-10-20 08:03:53,574 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:03:53,574 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 214 transitions. [2020-10-20 08:03:53,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 90 [2020-10-20 08:03:53,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:53,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:53,578 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,578 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:53,579 INFO L794 eck$LassoCheckResult]: Stem: 628#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 534#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 535#L408 assume !(1 == ~c_req_up~0); 526#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 600#L419-1 assume !(1 == ~c1_i~0);~c1_st~0 := 2; 601#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 621#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 632#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 564#L439-1 assume !(0 == ~e_f~0); 565#L444-1 assume !(0 == ~e_g~0); 598#L449-1 assume !(0 == ~e_e~0); 618#L454-1 assume !(0 == ~e_c~0); 631#L459-1 assume !(0 == ~e_wl~0); 556#L464-1 assume !(1 == ~wl_pc~0); 557#L476 assume !(2 == ~wl_pc~0); 597#L477 assume !(1 == ~c1_pc~0); 594#L487 assume !(1 == ~c2_pc~0); 551#L496 assume !(1 == ~wb_pc~0); 559#L505 assume !(1 == ~e_c~0); 560#L514-1 assume !(1 == ~e_e~0); 552#L519-1 assume !(1 == ~e_f~0); 553#L524-1 assume !(1 == ~e_g~0); 590#L529-1 assume !(1 == ~e_c~0); 612#L534-1 assume !(1 == ~e_wl~0); 515#L676-1 [2020-10-20 08:03:53,579 INFO L796 eck$LassoCheckResult]: Loop: 515#L676-1 assume !false; 521#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 575#L381 assume !false; 542#L299 assume !(0 == ~wl_st~0); 544#L303 assume !(0 == ~c1_st~0); 610#L306 assume !(0 == ~c2_st~0); 604#L309 assume !(0 == ~wb_st~0); 586#L312 assume !(0 == ~r_st~0); 587#L397 start_simulation_~kernel_st~0 := 2; 545#L552 assume !(1 == ~c_req_up~0); 547#L552-2 start_simulation_~kernel_st~0 := 3; 554#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 626#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 629#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 548#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 549#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 588#L584-1 assume 1 == ~wl_pc~0; 582#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 538#L597 assume !(1 == ~c1_pc~0); 569#L607 assume !(1 == ~c2_pc~0); 571#L616 assume !(1 == ~wb_pc~0); 578#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 580#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 581#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 605#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 624#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 524#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 525#L659-1 assume 0 == ~wl_st~0; 515#L676-1 [2020-10-20 08:03:53,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:53,579 INFO L82 PathProgramCache]: Analyzing trace with hash 1738779219, now seen corresponding path program 1 times [2020-10-20 08:03:53,580 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:53,580 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969957591] [2020-10-20 08:03:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:53,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969957591] [2020-10-20 08:03:53,652 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:53,652 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:53,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243387573] [2020-10-20 08:03:53,653 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:53,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:53,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1293976781, now seen corresponding path program 1 times [2020-10-20 08:03:53,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:53,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912519074] [2020-10-20 08:03:53,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:53,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:53,696 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:53,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:53,753 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:53,880 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2020-10-20 08:03:54,012 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:54,013 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:54,014 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:54,014 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:54,014 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:54,014 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,014 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:54,015 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:54,015 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration3_Loop [2020-10-20 08:03:54,015 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:54,015 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:54,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,464 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:54,465 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,476 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:54,476 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:54,487 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:54,487 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:54,534 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:54,534 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,539 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:54,539 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:54,586 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:54,587 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:54,638 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:54,638 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,644 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:54,679 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:54,679 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:54,679 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:54,679 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:54,680 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:54,680 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:54,680 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:54,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:54,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration3_Loop [2020-10-20 08:03:54,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:54,681 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:54,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:54,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:55,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:55,087 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:55,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:55,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:55,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:55,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:55,105 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:55,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:55,108 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:55,108 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:55,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:55,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:55,157 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:55,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:55,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:55,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:55,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:55,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:55,199 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:55,199 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:55,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:55,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:55,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:55,201 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:55,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:55,204 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:55,208 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:55,209 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:55,216 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:55,216 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:55,217 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:03:55,217 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:55,255 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:55,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:55,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:55,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:55,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:55,491 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:55,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:55,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:03:55,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 214 transitions. cyclomatic complexity: 94 Second operand 5 states. [2020-10-20 08:03:55,685 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 214 transitions. cyclomatic complexity: 94. Second operand 5 states. Result 397 states and 694 transitions. Complement of second has 5 states. [2020-10-20 08:03:55,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:03:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2020-10-20 08:03:55,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:55,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:55,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:55,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:55,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 374 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:55,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:55,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 397 states and 694 transitions. [2020-10-20 08:03:55,699 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2020-10-20 08:03:55,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 397 states to 397 states and 694 transitions. [2020-10-20 08:03:55,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 302 [2020-10-20 08:03:55,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 305 [2020-10-20 08:03:55,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 397 states and 694 transitions. [2020-10-20 08:03:55,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:55,706 INFO L691 BuchiCegarLoop]: Abstraction has 397 states and 694 transitions. [2020-10-20 08:03:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states and 694 transitions. [2020-10-20 08:03:55,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 304. [2020-10-20 08:03:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-20 08:03:55,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 533 transitions. [2020-10-20 08:03:55,726 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 533 transitions. [2020-10-20 08:03:55,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:55,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:55,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:55,727 INFO L87 Difference]: Start difference. First operand 304 states and 533 transitions. Second operand 3 states. [2020-10-20 08:03:55,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:55,739 INFO L93 Difference]: Finished difference Result 304 states and 532 transitions. [2020-10-20 08:03:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:55,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 532 transitions. [2020-10-20 08:03:55,743 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-10-20 08:03:55,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 304 states and 532 transitions. [2020-10-20 08:03:55,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2020-10-20 08:03:55,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2020-10-20 08:03:55,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 532 transitions. [2020-10-20 08:03:55,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:55,747 INFO L691 BuchiCegarLoop]: Abstraction has 304 states and 532 transitions. [2020-10-20 08:03:55,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 532 transitions. [2020-10-20 08:03:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-20 08:03:55,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-20 08:03:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 532 transitions. [2020-10-20 08:03:55,759 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 532 transitions. [2020-10-20 08:03:55,759 INFO L594 BuchiCegarLoop]: Abstraction has 304 states and 532 transitions. [2020-10-20 08:03:55,759 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:03:55,759 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 532 transitions. [2020-10-20 08:03:55,761 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-10-20 08:03:55,762 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:55,762 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:55,763 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:55,763 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:55,763 INFO L794 eck$LassoCheckResult]: Stem: 2026#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 1862#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 1863#L408 assume !(1 == ~c_req_up~0); 1839#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 1971#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 1972#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2008#L429-1 assume !(1 == ~wb_i~0);~wb_st~0 := 2; 2031#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 1904#L439-1 assume !(0 == ~e_f~0); 1905#L444-1 assume !(0 == ~e_g~0); 1968#L449-1 assume !(0 == ~e_e~0); 2003#L454-1 assume !(0 == ~e_c~0); 2030#L459-1 assume !(0 == ~e_wl~0); 1893#L464-1 assume !(1 == ~wl_pc~0); 1894#L476 assume !(2 == ~wl_pc~0); 1967#L477 assume !(1 == ~c1_pc~0); 1966#L487 assume !(1 == ~c2_pc~0); 1886#L496 assume !(1 == ~wb_pc~0); 1896#L505 assume !(1 == ~e_c~0); 1897#L514-1 assume !(1 == ~e_e~0); 1887#L519-1 assume !(1 == ~e_f~0); 1888#L524-1 assume !(1 == ~e_g~0); 1956#L529-1 assume !(1 == ~e_c~0); 1992#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1818#L676-1 [2020-10-20 08:03:55,764 INFO L796 eck$LassoCheckResult]: Loop: 1818#L676-1 assume !false; 1829#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 1924#L381 assume !false; 1868#L299 assume !(0 == ~wl_st~0); 1870#L303 assume !(0 == ~c1_st~0); 1989#L306 assume !(0 == ~c2_st~0); 1977#L309 assume !(0 == ~wb_st~0); 1946#L312 assume !(0 == ~r_st~0); 1947#L397 start_simulation_~kernel_st~0 := 2; 1874#L552 assume !(1 == ~c_req_up~0); 1876#L552-2 start_simulation_~kernel_st~0 := 3; 1889#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 2022#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2027#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2054#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 1950#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 1951#L584-1 assume !(1 == ~wl_pc~0); 1856#L596 assume !(2 == ~wl_pc~0); 1857#L597 assume !(1 == ~c1_pc~0); 1912#L607 assume !(1 == ~c2_pc~0); 1914#L616 assume !(1 == ~wb_pc~0); 1929#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 1934#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 1935#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 1979#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2040#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 1835#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 1836#L659-1 assume 0 == ~wl_st~0; 1818#L676-1 [2020-10-20 08:03:55,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:55,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1738539629, now seen corresponding path program 1 times [2020-10-20 08:03:55,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:55,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698267343] [2020-10-20 08:03:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:55,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698267343] [2020-10-20 08:03:55,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:55,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:55,797 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571681304] [2020-10-20 08:03:55,798 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:55,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash -744717060, now seen corresponding path program 2 times [2020-10-20 08:03:55,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:55,798 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514264619] [2020-10-20 08:03:55,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:55,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:55,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514264619] [2020-10-20 08:03:55,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:55,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 08:03:55,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470273254] [2020-10-20 08:03:55,824 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:55,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:55,825 INFO L87 Difference]: Start difference. First operand 304 states and 532 transitions. cyclomatic complexity: 231 Second operand 3 states. [2020-10-20 08:03:55,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:55,835 INFO L93 Difference]: Finished difference Result 304 states and 531 transitions. [2020-10-20 08:03:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:55,835 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 304 states and 531 transitions. [2020-10-20 08:03:55,838 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-10-20 08:03:55,841 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 304 states to 304 states and 531 transitions. [2020-10-20 08:03:55,842 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 212 [2020-10-20 08:03:55,842 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 212 [2020-10-20 08:03:55,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 304 states and 531 transitions. [2020-10-20 08:03:55,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:55,843 INFO L691 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-10-20 08:03:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states and 531 transitions. [2020-10-20 08:03:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2020-10-20 08:03:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-20 08:03:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 531 transitions. [2020-10-20 08:03:55,851 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-10-20 08:03:55,851 INFO L594 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-10-20 08:03:55,851 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:03:55,851 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 304 states and 531 transitions. [2020-10-20 08:03:55,869 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 180 [2020-10-20 08:03:55,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:55,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:55,871 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:55,871 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:55,872 INFO L794 eck$LassoCheckResult]: Stem: 2644#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 2469#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 2470#L408 assume !(1 == ~c_req_up~0); 2454#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 2589#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 2590#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 2626#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 2650#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 2520#L439-1 assume !(0 == ~e_f~0); 2521#L444-1 assume !(0 == ~e_g~0); 2585#L449-1 assume !(0 == ~e_e~0); 2621#L454-1 assume !(0 == ~e_c~0); 2649#L459-1 assume !(0 == ~e_wl~0); 2509#L464-1 assume !(1 == ~wl_pc~0); 2510#L476 assume !(2 == ~wl_pc~0); 2584#L477 assume !(1 == ~c1_pc~0); 2579#L487 assume !(1 == ~c2_pc~0); 2501#L496 assume !(1 == ~wb_pc~0); 2512#L505 assume !(1 == ~e_c~0); 2513#L514-1 assume !(1 == ~e_e~0); 2502#L519-1 assume !(1 == ~e_f~0); 2503#L524-1 assume !(1 == ~e_g~0); 2573#L529-1 assume !(1 == ~e_c~0); 2610#L534-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2433#L676-1 [2020-10-20 08:03:55,872 INFO L796 eck$LassoCheckResult]: Loop: 2433#L676-1 assume !false; 2444#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 2540#L381 assume !false; 2483#L299 assume !(0 == ~wl_st~0); 2485#L303 assume !(0 == ~c1_st~0); 2607#L306 assume !(0 == ~c2_st~0); 2595#L309 assume !(0 == ~wb_st~0); 2563#L312 assume !(0 == ~r_st~0); 2564#L397 start_simulation_~kernel_st~0 := 2; 2588#L552 assume !(1 == ~c_req_up~0); 2504#L552-2 start_simulation_~kernel_st~0 := 3; 2505#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 2645#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 2646#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 2656#L574-1 assume 0 == ~e_c~0;~e_c~0 := 1; 2658#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 2729#L584-1 assume 1 == ~wl_pc~0; 2726#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 2725#L597 assume !(1 == ~c1_pc~0); 2723#L607 assume !(1 == ~c2_pc~0); 2721#L616 assume !(1 == ~wb_pc~0); 2719#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 2718#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 2717#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 2716#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 2715#L649-1 assume 1 == ~e_c~0;~e_c~0 := 2; 2714#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 2548#L659-1 assume 0 == ~wl_st~0; 2433#L676-1 [2020-10-20 08:03:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:55,873 INFO L82 PathProgramCache]: Analyzing trace with hash 255605077, now seen corresponding path program 1 times [2020-10-20 08:03:55,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:55,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852674307] [2020-10-20 08:03:55,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:55,909 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852674307] [2020-10-20 08:03:55,909 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:55,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:55,910 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571074722] [2020-10-20 08:03:55,910 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:55,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1293976781, now seen corresponding path program 2 times [2020-10-20 08:03:55,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:55,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208499811] [2020-10-20 08:03:55,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:55,918 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:55,923 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:55,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:56,057 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:56,057 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:56,057 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:56,057 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:56,058 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:56,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:56,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:56,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration5_Loop [2020-10-20 08:03:56,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:56,058 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:56,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,468 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:56,468 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,472 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,477 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,477 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,531 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,531 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,537 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,538 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c2_st~0=7} Honda state: {~c2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,594 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,594 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,598 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,598 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet11=0} Honda state: {ULTIMATE.start_eval_#t~nondet11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,644 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,644 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,648 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,648 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,695 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,696 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,701 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,701 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet9=0} Honda state: {ULTIMATE.start_eval_#t~nondet9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,752 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,757 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,757 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet7=0} Honda state: {ULTIMATE.start_eval_#t~nondet7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,807 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,807 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,811 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,811 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,858 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,858 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:56,863 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:56,864 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c1_st~0=-5} Honda state: {~c1_st~0=-5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:56,909 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:56,909 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,956 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:03:56,956 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:03:56,963 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:03:56,983 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:56,983 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:56,983 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:56,984 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:56,984 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:03:56,984 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:56,984 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:56,985 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:56,985 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration5_Loop [2020-10-20 08:03:56,985 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:56,985 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:56,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:56,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:57,371 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:57,371 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,378 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,378 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,378 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:57,383 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,406 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:57,410 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,445 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,446 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,447 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,447 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:57,447 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,448 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:57,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:57,450 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:03:57,504 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,542 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,542 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,586 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,586 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,586 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,587 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,587 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,667 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,669 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,669 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,670 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:03:57,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,671 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:03:57,672 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,716 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:03:57,718 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:03:57,719 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:03:57,719 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:03:57,719 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:03:57,719 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:03:57,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:03:57,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,724 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:03:57,728 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:03:57,728 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:57,736 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:03:57,736 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:03:57,736 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:03:57,736 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_c~0) = -1*~e_c~0 + 1 Supporting invariants [] Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:57,772 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:03:57,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:03:57,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:57,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:03:57,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:03:57,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:57,872 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:03:57,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 304 states and 531 transitions. cyclomatic complexity: 230 Second operand 5 states. [2020-10-20 08:03:57,916 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 304 states and 531 transitions. cyclomatic complexity: 230. Second operand 5 states. Result 580 states and 1011 transitions. Complement of second has 5 states. [2020-10-20 08:03:57,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:03:57,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:03:57,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2020-10-20 08:03:57,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 28 letters. [2020-10-20 08:03:57,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:57,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 52 letters. Loop has 28 letters. [2020-10-20 08:03:57,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:57,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 372 transitions. Stem has 24 letters. Loop has 56 letters. [2020-10-20 08:03:57,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:03:57,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 580 states and 1011 transitions. [2020-10-20 08:03:57,926 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 360 [2020-10-20 08:03:57,931 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 580 states to 580 states and 1011 transitions. [2020-10-20 08:03:57,931 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 393 [2020-10-20 08:03:57,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 396 [2020-10-20 08:03:57,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 580 states and 1011 transitions. [2020-10-20 08:03:57,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:57,933 INFO L691 BuchiCegarLoop]: Abstraction has 580 states and 1011 transitions. [2020-10-20 08:03:57,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states and 1011 transitions. [2020-10-20 08:03:57,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 304. [2020-10-20 08:03:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2020-10-20 08:03:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 531 transitions. [2020-10-20 08:03:57,943 INFO L714 BuchiCegarLoop]: Abstraction has 304 states and 531 transitions. [2020-10-20 08:03:57,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:57,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:03:57,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:03:57,944 INFO L87 Difference]: Start difference. First operand 304 states and 531 transitions. Second operand 4 states. [2020-10-20 08:03:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:58,098 INFO L93 Difference]: Finished difference Result 577 states and 997 transitions. [2020-10-20 08:03:58,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:03:58,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 577 states and 997 transitions. [2020-10-20 08:03:58,108 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2020-10-20 08:03:58,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 577 states to 577 states and 997 transitions. [2020-10-20 08:03:58,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2020-10-20 08:03:58,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 378 [2020-10-20 08:03:58,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 577 states and 997 transitions. [2020-10-20 08:03:58,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:58,114 INFO L691 BuchiCegarLoop]: Abstraction has 577 states and 997 transitions. [2020-10-20 08:03:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states and 997 transitions. [2020-10-20 08:03:58,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2020-10-20 08:03:58,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2020-10-20 08:03:58,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 995 transitions. [2020-10-20 08:03:58,125 INFO L714 BuchiCegarLoop]: Abstraction has 575 states and 995 transitions. [2020-10-20 08:03:58,126 INFO L594 BuchiCegarLoop]: Abstraction has 575 states and 995 transitions. [2020-10-20 08:03:58,126 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 08:03:58,126 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 575 states and 995 transitions. [2020-10-20 08:03:58,130 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 301 [2020-10-20 08:03:58,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:58,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:58,131 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,131 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,131 INFO L794 eck$LassoCheckResult]: Stem: 4613#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 4425#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 4426#L408 assume !(1 == ~c_req_up~0); 4542#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 4671#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 4591#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 4592#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 4670#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 4468#L439-1 assume !(0 == ~e_f~0); 4469#L444-1 assume !(0 == ~e_g~0); 4585#L449-1 assume !(0 == ~e_e~0); 4586#L454-1 assume 0 == ~e_c~0;~e_c~0 := 1; 4624#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4640#L464-1 assume !(1 == ~wl_pc~0); 4656#L476 assume !(2 == ~wl_pc~0); 4654#L477 assume !(1 == ~c1_pc~0); 4652#L487 assume !(1 == ~c2_pc~0); 4650#L496 assume !(1 == ~wb_pc~0); 4648#L505 assume !(1 == ~e_c~0); 4647#L514-1 assume !(1 == ~e_e~0); 4646#L519-1 assume !(1 == ~e_f~0); 4645#L524-1 assume !(1 == ~e_g~0); 4644#L529-1 assume !(1 == ~e_c~0); 4642#L534-1 assume !(1 == ~e_wl~0); 4643#L676-1 assume !false; 4711#L546 [2020-10-20 08:03:58,131 INFO L796 eck$LassoCheckResult]: Loop: 4711#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 4897#L381 assume !false; 4896#L299 assume !(0 == ~wl_st~0); 4895#L303 assume !(0 == ~c1_st~0); 4894#L306 assume !(0 == ~c2_st~0); 4893#L309 assume !(0 == ~wb_st~0); 4891#L312 assume !(0 == ~r_st~0); 4890#L397 start_simulation_~kernel_st~0 := 2; 4437#L552 assume !(1 == ~c_req_up~0); 4439#L552-2 start_simulation_~kernel_st~0 := 3; 4450#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 4605#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 4614#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 4443#L574-1 assume !(0 == ~e_c~0); 4444#L579-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 4516#L584-1 assume 1 == ~wl_pc~0; 4872#L590 assume 1 == ~e_wl~0;~wl_st~0 := 0; 4871#L597 assume !(1 == ~c1_pc~0); 4869#L607 assume !(1 == ~c2_pc~0); 4867#L616 assume !(1 == ~wb_pc~0); 4865#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 4864#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 4863#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 4862#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 4861#L649-1 assume !(1 == ~e_c~0); 4859#L654-1 assume 1 == ~e_wl~0;~e_wl~0 := 2; 4860#L659-1 assume 0 == ~wl_st~0; 4944#L676-1 assume !false; 4711#L546 [2020-10-20 08:03:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,132 INFO L82 PathProgramCache]: Analyzing trace with hash 931746300, now seen corresponding path program 1 times [2020-10-20 08:03:58,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939038813] [2020-10-20 08:03:58,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939038813] [2020-10-20 08:03:58,158 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:03:58,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051610103] [2020-10-20 08:03:58,159 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:58,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1567745073, now seen corresponding path program 1 times [2020-10-20 08:03:58,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,159 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980826763] [2020-10-20 08:03:58,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980826763] [2020-10-20 08:03:58,174 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,174 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:58,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986355868] [2020-10-20 08:03:58,174 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:58,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:58,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:03:58,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:03:58,175 INFO L87 Difference]: Start difference. First operand 575 states and 995 transitions. cyclomatic complexity: 425 Second operand 4 states. [2020-10-20 08:03:58,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:58,312 INFO L93 Difference]: Finished difference Result 985 states and 1685 transitions. [2020-10-20 08:03:58,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:03:58,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 985 states and 1685 transitions. [2020-10-20 08:03:58,321 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 477 [2020-10-20 08:03:58,329 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 985 states to 985 states and 1685 transitions. [2020-10-20 08:03:58,329 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 603 [2020-10-20 08:03:58,330 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 603 [2020-10-20 08:03:58,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 985 states and 1685 transitions. [2020-10-20 08:03:58,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:58,331 INFO L691 BuchiCegarLoop]: Abstraction has 985 states and 1685 transitions. [2020-10-20 08:03:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states and 1685 transitions. [2020-10-20 08:03:58,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 961. [2020-10-20 08:03:58,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 961 states. [2020-10-20 08:03:58,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 961 states to 961 states and 1657 transitions. [2020-10-20 08:03:58,348 INFO L714 BuchiCegarLoop]: Abstraction has 961 states and 1657 transitions. [2020-10-20 08:03:58,348 INFO L594 BuchiCegarLoop]: Abstraction has 961 states and 1657 transitions. [2020-10-20 08:03:58,348 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 08:03:58,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 961 states and 1657 transitions. [2020-10-20 08:03:58,354 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 477 [2020-10-20 08:03:58,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:58,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:58,355 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,355 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,355 INFO L794 eck$LassoCheckResult]: Stem: 6194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 5987#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 5988#L408 assume !(1 == ~c_req_up~0); 6112#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 6114#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 6115#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 6207#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 6208#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 6038#L439-1 assume !(0 == ~e_f~0); 6039#L444-1 assume !(0 == ~e_g~0); 6109#L449-1 assume !(0 == ~e_e~0); 6203#L454-1 assume !(0 == ~e_c~0); 6204#L459-1 assume 0 == ~e_wl~0;~e_wl~0 := 1; 6274#L464-1 assume !(1 == ~wl_pc~0); 6272#L476 assume !(2 == ~wl_pc~0); 6270#L477 assume !(1 == ~c1_pc~0); 6268#L487 assume !(1 == ~c2_pc~0); 6266#L496 assume !(1 == ~wb_pc~0); 6264#L505 assume !(1 == ~e_c~0); 6263#L514-1 assume !(1 == ~e_e~0); 6261#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6262#L524-1 assume !(1 == ~e_g~0); 6310#L529-1 assume !(1 == ~e_c~0); 6259#L534-1 assume !(1 == ~e_wl~0); 6309#L676-1 assume !false; 6526#L546 [2020-10-20 08:03:58,356 INFO L796 eck$LassoCheckResult]: Loop: 6526#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 6700#L381 assume !false; 6698#L299 assume !(0 == ~wl_st~0); 6696#L303 assume !(0 == ~c1_st~0); 6694#L306 assume !(0 == ~c2_st~0); 6692#L309 assume !(0 == ~wb_st~0); 6688#L312 assume !(0 == ~r_st~0); 6686#L397 start_simulation_~kernel_st~0 := 2; 6681#L552 assume !(1 == ~c_req_up~0); 6678#L552-2 start_simulation_~kernel_st~0 := 3; 6675#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 6674#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 6220#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 6221#L574-1 assume !(0 == ~e_c~0); 6673#L579-1 assume !(0 == ~e_wl~0); 6672#L584-1 assume !(1 == ~wl_pc~0); 6657#L596 assume !(2 == ~wl_pc~0); 6669#L597 assume !(1 == ~c1_pc~0); 6667#L607 assume !(1 == ~c2_pc~0); 6666#L616 assume !(1 == ~wb_pc~0); 6661#L625 assume 1 == ~e_c~0;~r_st~0 := 0; 6070#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 6071#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 6125#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 6752#L649-1 assume !(1 == ~e_c~0); 6751#L654-1 assume !(1 == ~e_wl~0); 6540#L659-1 assume 0 == ~wl_st~0; 6712#L676-1 assume !false; 6526#L546 [2020-10-20 08:03:58,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,356 INFO L82 PathProgramCache]: Analyzing trace with hash -81217992, now seen corresponding path program 1 times [2020-10-20 08:03:58,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044647704] [2020-10-20 08:03:58,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044647704] [2020-10-20 08:03:58,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:03:58,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435747812] [2020-10-20 08:03:58,384 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:58,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1563289062, now seen corresponding path program 1 times [2020-10-20 08:03:58,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063927093] [2020-10-20 08:03:58,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063927093] [2020-10-20 08:03:58,412 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,413 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:58,413 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850380237] [2020-10-20 08:03:58,413 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:58,413 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:58,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:03:58,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:03:58,414 INFO L87 Difference]: Start difference. First operand 961 states and 1657 transitions. cyclomatic complexity: 705 Second operand 4 states. [2020-10-20 08:03:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:58,529 INFO L93 Difference]: Finished difference Result 1513 states and 2536 transitions. [2020-10-20 08:03:58,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:03:58,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1513 states and 2536 transitions. [2020-10-20 08:03:58,544 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 829 [2020-10-20 08:03:58,556 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1513 states to 1513 states and 2536 transitions. [2020-10-20 08:03:58,557 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 927 [2020-10-20 08:03:58,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 927 [2020-10-20 08:03:58,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1513 states and 2536 transitions. [2020-10-20 08:03:58,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:58,560 INFO L691 BuchiCegarLoop]: Abstraction has 1513 states and 2536 transitions. [2020-10-20 08:03:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states and 2536 transitions. [2020-10-20 08:03:58,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1464. [2020-10-20 08:03:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2020-10-20 08:03:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2473 transitions. [2020-10-20 08:03:58,588 INFO L714 BuchiCegarLoop]: Abstraction has 1464 states and 2473 transitions. [2020-10-20 08:03:58,589 INFO L594 BuchiCegarLoop]: Abstraction has 1464 states and 2473 transitions. [2020-10-20 08:03:58,589 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 08:03:58,589 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1464 states and 2473 transitions. [2020-10-20 08:03:58,598 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 826 [2020-10-20 08:03:58,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:58,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:58,600 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,600 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,600 INFO L794 eck$LassoCheckResult]: Stem: 8687#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 8473#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 8474#L408 assume !(1 == ~c_req_up~0); 8456#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 8607#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 8608#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 8703#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 8704#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 8722#L439-1 assume !(0 == ~e_f~0); 8598#L444-1 assume !(0 == ~e_g~0); 8599#L449-1 assume !(0 == ~e_e~0); 8697#L454-1 assume !(0 == ~e_c~0); 8698#L459-1 assume !(0 == ~e_wl~0); 8512#L464-1 assume !(1 == ~wl_pc~0); 8513#L476 assume !(2 == ~wl_pc~0); 8597#L477 assume !(1 == ~c1_pc~0); 8596#L487 assume !(1 == ~c2_pc~0); 8724#L496 assume !(1 == ~wb_pc~0); 8515#L505 assume !(1 == ~e_c~0); 8516#L514-1 assume !(1 == ~e_e~0); 8507#L519-1 assume 1 == ~e_f~0;~e_f~0 := 2; 8508#L524-1 assume !(1 == ~e_g~0); 8643#L529-1 assume !(1 == ~e_c~0); 8644#L534-1 assume !(1 == ~e_wl~0); 9136#L676-1 assume !false; 8449#L546 [2020-10-20 08:03:58,600 INFO L796 eck$LassoCheckResult]: Loop: 8449#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 8543#L381 assume !false; 8485#L299 assume !(0 == ~wl_st~0); 8487#L303 assume !(0 == ~c1_st~0); 8633#L306 assume !(0 == ~c2_st~0); 8618#L309 assume !(0 == ~wb_st~0); 8571#L312 assume !(0 == ~r_st~0); 8572#L397 start_simulation_~kernel_st~0 := 2; 8602#L552 assume !(1 == ~c_req_up~0); 8503#L552-2 start_simulation_~kernel_st~0 := 3; 8504#L564 assume 0 == ~e_f~0;~e_f~0 := 1; 9841#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 9840#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 9839#L574-1 assume !(0 == ~e_c~0); 9838#L579-1 assume !(0 == ~e_wl~0); 9837#L584-1 assume !(1 == ~wl_pc~0); 8475#L596 assume !(2 == ~wl_pc~0); 8476#L597 assume !(1 == ~c1_pc~0); 9833#L607 assume !(1 == ~c2_pc~0); 9831#L616 assume !(1 == ~wb_pc~0); 8661#L625 assume !(1 == ~e_c~0); 8557#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 8558#L639-1 assume 1 == ~e_f~0;~e_f~0 := 2; 8621#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 8670#L649-1 assume !(1 == ~e_c~0); 8452#L654-1 assume !(1 == ~e_wl~0); 8453#L659-1 assume 0 == ~wl_st~0; 8433#L676-1 assume !false; 8449#L546 [2020-10-20 08:03:58,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -668024006, now seen corresponding path program 1 times [2020-10-20 08:03:58,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375800751] [2020-10-20 08:03:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,631 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375800751] [2020-10-20 08:03:58,631 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,631 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 08:03:58,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005985523] [2020-10-20 08:03:58,632 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:03:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash 753942436, now seen corresponding path program 1 times [2020-10-20 08:03:58,632 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936794198] [2020-10-20 08:03:58,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936794198] [2020-10-20 08:03:58,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:58,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451714735] [2020-10-20 08:03:58,649 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:58,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 08:03:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 08:03:58,650 INFO L87 Difference]: Start difference. First operand 1464 states and 2473 transitions. cyclomatic complexity: 1021 Second operand 4 states. [2020-10-20 08:03:58,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:58,790 INFO L93 Difference]: Finished difference Result 1658 states and 2735 transitions. [2020-10-20 08:03:58,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 08:03:58,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1658 states and 2735 transitions. [2020-10-20 08:03:58,803 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 932 [2020-10-20 08:03:58,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1658 states to 1658 states and 2735 transitions. [2020-10-20 08:03:58,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1013 [2020-10-20 08:03:58,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1013 [2020-10-20 08:03:58,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1658 states and 2735 transitions. [2020-10-20 08:03:58,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:58,818 INFO L691 BuchiCegarLoop]: Abstraction has 1658 states and 2735 transitions. [2020-10-20 08:03:58,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states and 2735 transitions. [2020-10-20 08:03:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1614. [2020-10-20 08:03:58,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1614 states. [2020-10-20 08:03:58,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 2685 transitions. [2020-10-20 08:03:58,858 INFO L714 BuchiCegarLoop]: Abstraction has 1614 states and 2685 transitions. [2020-10-20 08:03:58,858 INFO L594 BuchiCegarLoop]: Abstraction has 1614 states and 2685 transitions. [2020-10-20 08:03:58,859 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 08:03:58,859 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1614 states and 2685 transitions. [2020-10-20 08:03:58,868 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 927 [2020-10-20 08:03:58,868 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:58,868 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:58,871 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,871 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:58,873 INFO L794 eck$LassoCheckResult]: Stem: 11814#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 11603#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 11604#L408 assume !(1 == ~c_req_up~0); 11588#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 11731#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 11780#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 11781#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 11862#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 11861#L439-1 assume !(0 == ~e_f~0); 11860#L444-1 assume !(0 == ~e_g~0); 11859#L449-1 assume !(0 == ~e_e~0); 11858#L454-1 assume !(0 == ~e_c~0); 11857#L459-1 assume !(0 == ~e_wl~0); 11856#L464-1 assume !(1 == ~wl_pc~0); 11853#L476 assume !(2 == ~wl_pc~0); 11852#L477 assume !(1 == ~c1_pc~0); 11817#L487 assume !(1 == ~c2_pc~0); 11634#L496 assume !(1 == ~wb_pc~0); 11762#L505 assume !(1 == ~e_c~0); 11844#L514-1 assume !(1 == ~e_e~0); 11845#L519-1 assume !(1 == ~e_f~0); 11710#L524-1 assume !(1 == ~e_g~0); 11711#L529-1 assume !(1 == ~e_c~0); 11764#L534-1 assume !(1 == ~e_wl~0); 11803#L676-1 assume !false; 12066#L546 [2020-10-20 08:03:58,873 INFO L796 eck$LassoCheckResult]: Loop: 12066#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 12850#L381 assume !false; 12804#L299 assume !(0 == ~wl_st~0); 12803#L303 assume !(0 == ~c1_st~0); 12802#L306 assume !(0 == ~c2_st~0); 12799#L309 assume !(0 == ~wb_st~0); 12796#L312 assume !(0 == ~r_st~0); 12798#L397 start_simulation_~kernel_st~0 := 2; 12898#L552 assume !(1 == ~c_req_up~0); 12894#L552-2 start_simulation_~kernel_st~0 := 3; 12891#L564 assume !(0 == ~e_f~0); 12889#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 12887#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 12885#L574-1 assume !(0 == ~e_c~0); 12884#L579-1 assume !(0 == ~e_wl~0); 12883#L584-1 assume !(1 == ~wl_pc~0); 12880#L596 assume !(2 == ~wl_pc~0); 12879#L597 assume !(1 == ~c1_pc~0); 12877#L607 assume !(1 == ~c2_pc~0); 12875#L616 assume !(1 == ~wb_pc~0); 12873#L625 assume !(1 == ~e_c~0); 12872#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 12871#L639-1 assume !(1 == ~e_f~0); 12870#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 12869#L649-1 assume !(1 == ~e_c~0); 12868#L654-1 assume !(1 == ~e_wl~0); 12867#L659-1 assume 0 == ~wl_st~0; 12814#L676-1 assume !false; 12066#L546 [2020-10-20 08:03:58,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 1 times [2020-10-20 08:03:58,874 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741784080] [2020-10-20 08:03:58,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:58,898 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:58,914 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:58,937 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:58,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:58,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1182943968, now seen corresponding path program 1 times [2020-10-20 08:03:58,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:58,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305988940] [2020-10-20 08:03:58,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:58,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:58,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305988940] [2020-10-20 08:03:58,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:58,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:58,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809997977] [2020-10-20 08:03:58,980 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:03:58,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:03:58,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:03:58,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:03:58,980 INFO L87 Difference]: Start difference. First operand 1614 states and 2685 transitions. cyclomatic complexity: 1083 Second operand 3 states. [2020-10-20 08:03:59,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:03:59,034 INFO L93 Difference]: Finished difference Result 2558 states and 4217 transitions. [2020-10-20 08:03:59,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:03:59,034 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2558 states and 4217 transitions. [2020-10-20 08:03:59,052 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1483 [2020-10-20 08:03:59,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2558 states to 2558 states and 4217 transitions. [2020-10-20 08:03:59,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1546 [2020-10-20 08:03:59,072 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1546 [2020-10-20 08:03:59,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2558 states and 4217 transitions. [2020-10-20 08:03:59,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:03:59,072 INFO L691 BuchiCegarLoop]: Abstraction has 2558 states and 4217 transitions. [2020-10-20 08:03:59,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states and 4217 transitions. [2020-10-20 08:03:59,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2558. [2020-10-20 08:03:59,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2020-10-20 08:03:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 4217 transitions. [2020-10-20 08:03:59,118 INFO L714 BuchiCegarLoop]: Abstraction has 2558 states and 4217 transitions. [2020-10-20 08:03:59,118 INFO L594 BuchiCegarLoop]: Abstraction has 2558 states and 4217 transitions. [2020-10-20 08:03:59,118 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 08:03:59,119 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2558 states and 4217 transitions. [2020-10-20 08:03:59,315 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1483 [2020-10-20 08:03:59,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:03:59,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:03:59,316 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:59,316 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:03:59,316 INFO L794 eck$LassoCheckResult]: Stem: 16003#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 15785#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 15786#L408 assume !(1 == ~c_req_up~0); 15768#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 15910#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 15967#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 15968#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 16050#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 16049#L439-1 assume !(0 == ~e_f~0); 16048#L444-1 assume !(0 == ~e_g~0); 16047#L449-1 assume !(0 == ~e_e~0); 16046#L454-1 assume !(0 == ~e_c~0); 16045#L459-1 assume !(0 == ~e_wl~0); 16044#L464-1 assume !(1 == ~wl_pc~0); 16041#L476 assume !(2 == ~wl_pc~0); 16040#L477 assume !(1 == ~c1_pc~0); 16006#L487 assume !(1 == ~c2_pc~0); 15814#L496 assume !(1 == ~wb_pc~0); 15945#L505 assume !(1 == ~e_c~0); 16032#L514-1 assume !(1 == ~e_e~0); 16033#L519-1 assume !(1 == ~e_f~0); 15888#L524-1 assume !(1 == ~e_g~0); 15889#L529-1 assume !(1 == ~e_c~0); 15947#L534-1 assume !(1 == ~e_wl~0); 15993#L676-1 assume !false; 16346#L546 [2020-10-20 08:03:59,316 INFO L796 eck$LassoCheckResult]: Loop: 16346#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 17352#L381 assume !false; 17353#L299 assume !(0 == ~wl_st~0); 17714#L303 assume !(0 == ~c1_st~0); 17713#L306 assume !(0 == ~c2_st~0); 17712#L309 assume !(0 == ~wb_st~0); 17702#L312 assume !(0 == ~r_st~0); 17704#L397 start_simulation_~kernel_st~0 := 2; 17666#L552 assume !(1 == ~c_req_up~0); 17667#L552-2 start_simulation_~kernel_st~0 := 3; 17875#L564 assume !(0 == ~e_f~0); 17874#L564-2 assume 0 == ~e_g~0;~e_g~0 := 1; 17873#L569-1 assume 0 == ~e_e~0;~e_e~0 := 1; 17871#L574-1 assume !(0 == ~e_c~0); 17870#L579-1 assume !(0 == ~e_wl~0); 17869#L584-1 assume !(1 == ~wl_pc~0); 17866#L596 assume 2 == ~wl_pc~0; 17867#L598 assume 1 == ~e_e~0;~wl_st~0 := 0; 16022#L597 assume !(1 == ~c1_pc~0); 15842#L607 assume !(1 == ~c2_pc~0); 15844#L616 assume !(1 == ~wb_pc~0); 15859#L625 assume !(1 == ~e_c~0); 15865#L634-1 assume 1 == ~e_e~0;~e_e~0 := 2; 15866#L639-1 assume !(1 == ~e_f~0); 15926#L644-1 assume 1 == ~e_g~0;~e_g~0 := 2; 15985#L649-1 assume !(1 == ~e_c~0); 17441#L654-1 assume !(1 == ~e_wl~0); 17415#L659-1 assume 0 == ~wl_st~0; 17414#L676-1 assume !false; 16346#L546 [2020-10-20 08:03:59,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,317 INFO L82 PathProgramCache]: Analyzing trace with hash -666176964, now seen corresponding path program 2 times [2020-10-20 08:03:59,317 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:59,317 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521815325] [2020-10-20 08:03:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:59,328 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:59,335 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:59,343 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1234385909, now seen corresponding path program 1 times [2020-10-20 08:03:59,344 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:59,344 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756843304] [2020-10-20 08:03:59,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:59,349 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:03:59,351 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:03:59,355 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:03:59,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:03:59,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1871779738, now seen corresponding path program 1 times [2020-10-20 08:03:59,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:03:59,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316565217] [2020-10-20 08:03:59,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:03:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:03:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:03:59,383 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316565217] [2020-10-20 08:03:59,383 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:03:59,383 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:03:59,384 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336753616] [2020-10-20 08:03:59,486 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2020-10-20 08:03:59,543 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:03:59,543 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:03:59,543 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:03:59,543 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:03:59,544 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:03:59,544 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,544 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:03:59,544 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:03:59,544 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2020-10-20 08:03:59,544 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:03:59,544 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:03:59,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:03:59,904 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:03:59,904 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:59,918 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,922 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:59,923 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___3~0=0} Honda state: {ULTIMATE.start_eval_~tmp___3~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:03:59,960 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:03:59,960 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:03:59,965 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:03:59,965 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~r_st~0=7} Honda state: {~r_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:00,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,000 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,003 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:00,004 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet10=0} Honda state: {ULTIMATE.start_eval_#t~nondet10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:00,048 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,048 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,051 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-10-20 08:04:00,052 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp~0=0} Honda state: {ULTIMATE.start_eval_~tmp~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:00,087 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:04:00,087 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 08:04:00,128 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:04:00,128 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,133 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:04:00,166 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:04:00,167 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:04:00,167 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:04:00,167 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:04:00,167 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:04:00,167 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,167 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:04:00,167 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:04:00,167 INFO L133 ssoRankerPreferences]: Filename of dumped script: toy1.cil.c_Iteration10_Loop [2020-10-20 08:04:00,167 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:04:00,168 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:04:00,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-20 08:04:00,524 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:04:00,524 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,529 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:04:00,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:00,530 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:00,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:00,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:00,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:00,531 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:00,531 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:00,535 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:04:00,560 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:00,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:00,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:00,561 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-10-20 08:04:00,561 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:00,562 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-10-20 08:04:00,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:00,564 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,587 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-20 08:04:00,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:04:00,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:04:00,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:04:00,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:04:00,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:04:00,591 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:04:00,591 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:04:00,594 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:04:00,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:04:00,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:04:00,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:04:00,611 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:04:00,611 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:04:00,611 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(~e_e~0) = -1*~e_e~0 + 1 Supporting invariants [] [2020-10-20 08:04:00,633 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:04:00,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:00,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:04:00,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:04:00,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:00,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:04:00,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:04:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:00,737 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-10-20 08:04:00,737 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2558 states and 4217 transitions. cyclomatic complexity: 1671 Second operand 5 states. [2020-10-20 08:04:00,829 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2558 states and 4217 transitions. cyclomatic complexity: 1671. Second operand 5 states. Result 6901 states and 11356 transitions. Complement of second has 5 states. [2020-10-20 08:04:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 08:04:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 08:04:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2020-10-20 08:04:00,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 25 letters. Loop has 29 letters. [2020-10-20 08:04:00,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:00,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 54 letters. Loop has 29 letters. [2020-10-20 08:04:00,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:00,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 25 letters. Loop has 58 letters. [2020-10-20 08:04:00,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:04:00,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6901 states and 11356 transitions. [2020-10-20 08:04:00,876 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2732 [2020-10-20 08:04:00,930 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6901 states to 6901 states and 11356 transitions. [2020-10-20 08:04:00,930 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2804 [2020-10-20 08:04:00,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2841 [2020-10-20 08:04:00,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6901 states and 11356 transitions. [2020-10-20 08:04:00,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:00,935 INFO L691 BuchiCegarLoop]: Abstraction has 6901 states and 11356 transitions. [2020-10-20 08:04:00,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6901 states and 11356 transitions. [2020-10-20 08:04:01,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6901 to 6864. [2020-10-20 08:04:01,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6864 states. [2020-10-20 08:04:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6864 states to 6864 states and 11294 transitions. [2020-10-20 08:04:01,358 INFO L714 BuchiCegarLoop]: Abstraction has 6864 states and 11294 transitions. [2020-10-20 08:04:01,359 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:01,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:01,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:01,360 INFO L87 Difference]: Start difference. First operand 6864 states and 11294 transitions. Second operand 3 states. [2020-10-20 08:04:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:01,425 INFO L93 Difference]: Finished difference Result 5433 states and 8937 transitions. [2020-10-20 08:04:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:01,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 5433 states and 8937 transitions. [2020-10-20 08:04:01,464 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2130 [2020-10-20 08:04:01,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 5433 states to 5433 states and 8937 transitions. [2020-10-20 08:04:01,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2200 [2020-10-20 08:04:01,525 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2200 [2020-10-20 08:04:01,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5433 states and 8937 transitions. [2020-10-20 08:04:01,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:01,528 INFO L691 BuchiCegarLoop]: Abstraction has 5433 states and 8937 transitions. [2020-10-20 08:04:01,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states and 8937 transitions. [2020-10-20 08:04:01,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 5225. [2020-10-20 08:04:01,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5225 states. [2020-10-20 08:04:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 8599 transitions. [2020-10-20 08:04:01,656 INFO L714 BuchiCegarLoop]: Abstraction has 5225 states and 8599 transitions. [2020-10-20 08:04:01,964 INFO L594 BuchiCegarLoop]: Abstraction has 5225 states and 8599 transitions. [2020-10-20 08:04:01,964 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 08:04:01,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5225 states and 8599 transitions. [2020-10-20 08:04:01,981 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2059 [2020-10-20 08:04:01,982 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:01,982 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:01,982 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:01,982 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:01,983 INFO L794 eck$LassoCheckResult]: Stem: 37949#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 37731#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 37732#L408 assume !(1 == ~c_req_up~0); 37845#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 37862#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 37917#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 37918#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 37994#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 37770#L439-1 assume !(0 == ~e_f~0); 37771#L444-1 assume !(0 == ~e_g~0); 37911#L449-1 assume !(0 == ~e_e~0); 37912#L454-1 assume !(0 == ~e_c~0); 37993#L459-1 assume !(0 == ~e_wl~0); 37759#L464-1 assume !(1 == ~wl_pc~0); 37760#L476 assume !(2 == ~wl_pc~0); 37838#L477 assume !(1 == ~c1_pc~0); 37837#L487 assume !(1 == ~c2_pc~0); 37988#L496 assume !(1 == ~wb_pc~0); 37762#L505 assume !(1 == ~e_c~0); 37763#L514-1 assume !(1 == ~e_e~0); 37982#L519-1 assume !(1 == ~e_f~0); 37826#L524-1 assume !(1 == ~e_g~0); 37827#L529-1 assume !(1 == ~e_c~0); 37898#L534-1 assume !(1 == ~e_wl~0); 38937#L676-1 assume !false; 38938#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 40891#L381 [2020-10-20 08:04:01,983 INFO L796 eck$LassoCheckResult]: Loop: 40891#L381 assume !false; 42457#L299 assume 0 == ~wl_st~0; 42456#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 41945#L325 assume !(0 != eval_~tmp~0); 41946#L321 assume !(0 == ~c1_st~0); 42469#L336 assume !(0 == ~c2_st~0); 42463#L351 assume !(0 == ~wb_st~0); 42460#L366 assume !(0 == ~r_st~0); 40891#L381 [2020-10-20 08:04:01,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:01,983 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 1 times [2020-10-20 08:04:01,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:01,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022685519] [2020-10-20 08:04:01,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:01,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:01,991 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:01,998 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,007 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:02,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1293189375, now seen corresponding path program 1 times [2020-10-20 08:04:02,008 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,009 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41585265] [2020-10-20 08:04:02,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,012 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,014 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,016 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:02,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,016 INFO L82 PathProgramCache]: Analyzing trace with hash 374234871, now seen corresponding path program 1 times [2020-10-20 08:04:02,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950547393] [2020-10-20 08:04:02,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,061 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950547393] [2020-10-20 08:04:02,061 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,061 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:02,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902495018] [2020-10-20 08:04:02,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:02,089 INFO L87 Difference]: Start difference. First operand 5225 states and 8599 transitions. cyclomatic complexity: 3401 Second operand 3 states. [2020-10-20 08:04:02,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:02,146 INFO L93 Difference]: Finished difference Result 8215 states and 13416 transitions. [2020-10-20 08:04:02,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:02,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8215 states and 13416 transitions. [2020-10-20 08:04:02,189 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3271 [2020-10-20 08:04:02,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8215 states to 8215 states and 13416 transitions. [2020-10-20 08:04:02,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3349 [2020-10-20 08:04:02,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3349 [2020-10-20 08:04:02,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8215 states and 13416 transitions. [2020-10-20 08:04:02,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:02,264 INFO L691 BuchiCegarLoop]: Abstraction has 8215 states and 13416 transitions. [2020-10-20 08:04:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8215 states and 13416 transitions. [2020-10-20 08:04:02,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8215 to 8215. [2020-10-20 08:04:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8215 states. [2020-10-20 08:04:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8215 states to 8215 states and 13416 transitions. [2020-10-20 08:04:02,492 INFO L714 BuchiCegarLoop]: Abstraction has 8215 states and 13416 transitions. [2020-10-20 08:04:02,492 INFO L594 BuchiCegarLoop]: Abstraction has 8215 states and 13416 transitions. [2020-10-20 08:04:02,492 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 08:04:02,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8215 states and 13416 transitions. [2020-10-20 08:04:02,523 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 3271 [2020-10-20 08:04:02,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:02,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:02,525 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,525 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:02,526 INFO L794 eck$LassoCheckResult]: Stem: 51408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 51172#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 51173#L408 assume !(1 == ~c_req_up~0); 51301#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 51315#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 51370#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 51371#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 51450#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 51221#L439-1 assume !(0 == ~e_f~0); 51222#L444-1 assume !(0 == ~e_g~0); 51361#L449-1 assume !(0 == ~e_e~0); 51362#L454-1 assume !(0 == ~e_c~0); 51449#L459-1 assume !(0 == ~e_wl~0); 51210#L464-1 assume !(1 == ~wl_pc~0); 51211#L476 assume !(2 == ~wl_pc~0); 51292#L477 assume !(1 == ~c1_pc~0); 51291#L487 assume !(1 == ~c2_pc~0); 51444#L496 assume !(1 == ~wb_pc~0); 51213#L505 assume !(1 == ~e_c~0); 51214#L514-1 assume !(1 == ~e_e~0); 51437#L519-1 assume !(1 == ~e_f~0); 51280#L524-1 assume !(1 == ~e_g~0); 51281#L529-1 assume !(1 == ~e_c~0); 51351#L534-1 assume !(1 == ~e_wl~0); 51397#L676-1 assume !false; 53393#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 55675#L381 [2020-10-20 08:04:02,526 INFO L796 eck$LassoCheckResult]: Loop: 55675#L381 assume !false; 58317#L299 assume 0 == ~wl_st~0; 58315#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 58312#L325 assume !(0 != eval_~tmp~0); 58313#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 58424#L340 assume !(0 != eval_~tmp___0~0); 58333#L336 assume !(0 == ~c2_st~0); 58327#L351 assume !(0 == ~wb_st~0); 58323#L366 assume !(0 == ~r_st~0); 55675#L381 [2020-10-20 08:04:02,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,527 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 2 times [2020-10-20 08:04:02,527 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,527 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226986473] [2020-10-20 08:04:02,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,542 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,564 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:02,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1383392736, now seen corresponding path program 1 times [2020-10-20 08:04:02,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095567218] [2020-10-20 08:04:02,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,569 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:02,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:02,572 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:02,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1334393112, now seen corresponding path program 1 times [2020-10-20 08:04:02,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:02,573 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137448302] [2020-10-20 08:04:02,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:02,619 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137448302] [2020-10-20 08:04:02,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:02,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:02,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056305363] [2020-10-20 08:04:02,654 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:02,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:02,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:02,654 INFO L87 Difference]: Start difference. First operand 8215 states and 13416 transitions. cyclomatic complexity: 5228 Second operand 3 states. [2020-10-20 08:04:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:02,717 INFO L93 Difference]: Finished difference Result 12970 states and 20881 transitions. [2020-10-20 08:04:02,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:02,718 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12970 states and 20881 transitions. [2020-10-20 08:04:03,055 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-10-20 08:04:03,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12970 states to 12970 states and 20881 transitions. [2020-10-20 08:04:03,099 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5332 [2020-10-20 08:04:03,104 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5332 [2020-10-20 08:04:03,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12970 states and 20881 transitions. [2020-10-20 08:04:03,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:03,105 INFO L691 BuchiCegarLoop]: Abstraction has 12970 states and 20881 transitions. [2020-10-20 08:04:03,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12970 states and 20881 transitions. [2020-10-20 08:04:03,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12970 to 12970. [2020-10-20 08:04:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12970 states. [2020-10-20 08:04:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12970 states to 12970 states and 20881 transitions. [2020-10-20 08:04:03,309 INFO L714 BuchiCegarLoop]: Abstraction has 12970 states and 20881 transitions. [2020-10-20 08:04:03,310 INFO L594 BuchiCegarLoop]: Abstraction has 12970 states and 20881 transitions. [2020-10-20 08:04:03,310 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 08:04:03,310 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12970 states and 20881 transitions. [2020-10-20 08:04:03,344 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-10-20 08:04:03,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:03,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:03,345 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:03,345 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:03,346 INFO L794 eck$LassoCheckResult]: Stem: 72603#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 72374#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 72375#L408 assume !(1 == ~c_req_up~0); 72350#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 72499#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 72500#L424-1 assume !(1 == ~c2_i~0);~c2_st~0 := 2; 72619#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 72620#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 72639#L439-1 assume !(0 == ~e_f~0); 72491#L444-1 assume !(0 == ~e_g~0); 72492#L449-1 assume !(0 == ~e_e~0); 72613#L454-1 assume !(0 == ~e_c~0); 72614#L459-1 assume !(0 == ~e_wl~0); 72638#L464-1 assume !(1 == ~wl_pc~0); 72610#L476 assume !(2 == ~wl_pc~0); 72611#L477 assume !(1 == ~c1_pc~0); 72609#L487 assume !(1 == ~c2_pc~0); 72395#L496 assume !(1 == ~wb_pc~0); 72544#L505 assume !(1 == ~e_c~0); 72636#L514-1 assume !(1 == ~e_e~0); 72637#L519-1 assume !(1 == ~e_f~0); 72475#L524-1 assume !(1 == ~e_g~0); 72476#L529-1 assume !(1 == ~e_c~0); 72546#L534-1 assume !(1 == ~e_wl~0); 72594#L676-1 assume !false; 76554#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 81284#L381 [2020-10-20 08:04:03,346 INFO L796 eck$LassoCheckResult]: Loop: 81284#L381 assume !false; 82530#L299 assume 0 == ~wl_st~0; 82529#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 82527#L325 assume !(0 != eval_~tmp~0); 82528#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 82563#L340 assume !(0 != eval_~tmp___0~0); 81294#L336 assume !(0 == ~c2_st~0); 81296#L351 assume !(0 == ~wb_st~0); 82533#L366 assume !(0 == ~r_st~0); 81284#L381 [2020-10-20 08:04:03,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1246052603, now seen corresponding path program 1 times [2020-10-20 08:04:03,347 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078130228] [2020-10-20 08:04:03,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:03,360 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078130228] [2020-10-20 08:04:03,361 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:03,361 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:03,361 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089324673] [2020-10-20 08:04:03,361 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:04:03,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:03,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1383392736, now seen corresponding path program 2 times [2020-10-20 08:04:03,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:03,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522493089] [2020-10-20 08:04:03,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:03,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,365 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:03,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:03,368 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:03,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:03,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:03,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:03,399 INFO L87 Difference]: Start difference. First operand 12970 states and 20881 transitions. cyclomatic complexity: 7938 Second operand 3 states. [2020-10-20 08:04:03,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:03,442 INFO L93 Difference]: Finished difference Result 12918 states and 20794 transitions. [2020-10-20 08:04:03,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:03,443 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12918 states and 20794 transitions. [2020-10-20 08:04:03,863 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-10-20 08:04:03,913 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12918 states to 12918 states and 20794 transitions. [2020-10-20 08:04:03,913 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5282 [2020-10-20 08:04:03,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5282 [2020-10-20 08:04:03,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12918 states and 20794 transitions. [2020-10-20 08:04:03,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:03,919 INFO L691 BuchiCegarLoop]: Abstraction has 12918 states and 20794 transitions. [2020-10-20 08:04:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12918 states and 20794 transitions. [2020-10-20 08:04:04,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12918 to 12918. [2020-10-20 08:04:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12918 states. [2020-10-20 08:04:04,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12918 states to 12918 states and 20794 transitions. [2020-10-20 08:04:04,143 INFO L714 BuchiCegarLoop]: Abstraction has 12918 states and 20794 transitions. [2020-10-20 08:04:04,144 INFO L594 BuchiCegarLoop]: Abstraction has 12918 states and 20794 transitions. [2020-10-20 08:04:04,144 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 08:04:04,144 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12918 states and 20794 transitions. [2020-10-20 08:04:04,180 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 5188 [2020-10-20 08:04:04,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:04,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:04,181 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,181 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:04,181 INFO L794 eck$LassoCheckResult]: Stem: 98478#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 98257#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 98258#L408 assume !(1 == ~c_req_up~0); 98244#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 98390#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 98443#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 98444#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 98519#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 98518#L439-1 assume !(0 == ~e_f~0); 98517#L444-1 assume !(0 == ~e_g~0); 98516#L449-1 assume !(0 == ~e_e~0); 98515#L454-1 assume !(0 == ~e_c~0); 98514#L459-1 assume !(0 == ~e_wl~0); 98513#L464-1 assume !(1 == ~wl_pc~0); 98510#L476 assume !(2 == ~wl_pc~0); 98509#L477 assume !(1 == ~c1_pc~0); 98482#L487 assume !(1 == ~c2_pc~0); 98288#L496 assume !(1 == ~wb_pc~0); 98423#L505 assume !(1 == ~e_c~0); 98501#L514-1 assume !(1 == ~e_e~0); 98502#L519-1 assume !(1 == ~e_f~0); 98369#L524-1 assume !(1 == ~e_g~0); 98370#L529-1 assume !(1 == ~e_c~0); 98425#L534-1 assume !(1 == ~e_wl~0); 98468#L676-1 assume !false; 101949#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 106297#L381 [2020-10-20 08:04:04,182 INFO L796 eck$LassoCheckResult]: Loop: 106297#L381 assume !false; 107295#L299 assume 0 == ~wl_st~0; 107291#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 107288#L325 assume !(0 != eval_~tmp~0); 107289#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 108970#L340 assume !(0 != eval_~tmp___0~0); 107315#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 107311#L355 assume !(0 != eval_~tmp___1~0); 107308#L351 assume !(0 == ~wb_st~0); 107303#L366 assume !(0 == ~r_st~0); 106297#L381 [2020-10-20 08:04:04,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,182 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 3 times [2020-10-20 08:04:04,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450869570] [2020-10-20 08:04:04,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,191 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,197 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,203 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,204 INFO L82 PathProgramCache]: Analyzing trace with hash -66118102, now seen corresponding path program 1 times [2020-10-20 08:04:04,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883046117] [2020-10-20 08:04:04,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,208 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:04,211 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:04,213 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:04,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1581866530, now seen corresponding path program 1 times [2020-10-20 08:04:04,214 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:04,214 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667465766] [2020-10-20 08:04:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:04,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:04:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 08:04:04,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667465766] [2020-10-20 08:04:04,238 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:04:04,238 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:04:04,238 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916324014] [2020-10-20 08:04:04,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:04:04,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:04:04,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:04:04,283 INFO L87 Difference]: Start difference. First operand 12918 states and 20794 transitions. cyclomatic complexity: 7903 Second operand 3 states. [2020-10-20 08:04:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:04:04,461 INFO L93 Difference]: Finished difference Result 22109 states and 35110 transitions. [2020-10-20 08:04:04,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:04:04,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22109 states and 35110 transitions. [2020-10-20 08:04:04,561 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 8906 [2020-10-20 08:04:04,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22109 states to 22109 states and 35110 transitions. [2020-10-20 08:04:04,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9032 [2020-10-20 08:04:04,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9032 [2020-10-20 08:04:04,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22109 states and 35110 transitions. [2020-10-20 08:04:04,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 08:04:04,669 INFO L691 BuchiCegarLoop]: Abstraction has 22109 states and 35110 transitions. [2020-10-20 08:04:04,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22109 states and 35110 transitions. [2020-10-20 08:04:05,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22109 to 22109. [2020-10-20 08:04:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22109 states. [2020-10-20 08:04:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22109 states to 22109 states and 35110 transitions. [2020-10-20 08:04:05,604 INFO L714 BuchiCegarLoop]: Abstraction has 22109 states and 35110 transitions. [2020-10-20 08:04:05,604 INFO L594 BuchiCegarLoop]: Abstraction has 22109 states and 35110 transitions. [2020-10-20 08:04:05,604 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 08:04:05,605 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22109 states and 35110 transitions. [2020-10-20 08:04:05,682 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 8906 [2020-10-20 08:04:05,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:04:05,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:04:05,683 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:05,683 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:04:05,684 INFO L794 eck$LassoCheckResult]: Stem: 133521#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(11);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~c~0 := 0;~c_t~0 := 0;~c_req_up~0 := 0;~p_in~0 := 0;~p_out~0 := 0;~wl_st~0 := 0;~c1_st~0 := 0;~c2_st~0 := 0;~wb_st~0 := 0;~r_st~0 := 0;~wl_i~0 := 0;~c1_i~0 := 0;~c2_i~0 := 0;~wb_i~0 := 0;~r_i~0 := 0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~e_e~0 := 0;~e_f~0 := 0;~e_g~0 := 0;~e_c~0 := 0;~e_p_in~0 := 0;~e_wl~0 := 0;~d~0 := 0;~data~0 := 0;~processed~0 := 0;~t_b~0 := 0; 133296#L-1 havoc main_#res;havoc main_~__retres1~0;havoc main_~__retres1~0;~e_wl~0 := 2;~e_c~0 := ~e_wl~0;~e_g~0 := ~e_c~0;~e_f~0 := ~e_g~0;~e_e~0 := ~e_f~0;~wl_pc~0 := 0;~c1_pc~0 := 0;~c2_pc~0 := 0;~wb_pc~0 := 0;~wb_i~0 := 1;~c2_i~0 := ~wb_i~0;~c1_i~0 := ~c2_i~0;~wl_i~0 := ~c1_i~0;~r_i~0 := 0;~c_req_up~0 := 0;~d~0 := 0;~c~0 := 0;havoc start_simulation_~kernel_st~0;havoc start_simulation_~kernel_st~0;start_simulation_~kernel_st~0 := 0; 133297#L408 assume !(1 == ~c_req_up~0); 133425#L408-2 assume 1 == ~wl_i~0;~wl_st~0 := 0; 133437#L419-1 assume 1 == ~c1_i~0;~c1_st~0 := 0; 133487#L424-1 assume 1 == ~c2_i~0;~c2_st~0 := 0; 133488#L429-1 assume 1 == ~wb_i~0;~wb_st~0 := 0; 133565#L434-1 assume !(1 == ~r_i~0);~r_st~0 := 2; 133345#L439-1 assume !(0 == ~e_f~0); 133346#L444-1 assume !(0 == ~e_g~0); 133481#L449-1 assume !(0 == ~e_e~0); 133482#L454-1 assume !(0 == ~e_c~0); 133564#L459-1 assume !(0 == ~e_wl~0); 133332#L464-1 assume !(1 == ~wl_pc~0); 133333#L476 assume !(2 == ~wl_pc~0); 133418#L477 assume !(1 == ~c1_pc~0); 133417#L487 assume !(1 == ~c2_pc~0); 133559#L496 assume !(1 == ~wb_pc~0); 133335#L505 assume !(1 == ~e_c~0); 133336#L514-1 assume !(1 == ~e_e~0); 133552#L519-1 assume !(1 == ~e_f~0); 133404#L524-1 assume !(1 == ~e_g~0); 133405#L529-1 assume !(1 == ~e_c~0); 133473#L534-1 assume !(1 == ~e_wl~0); 133511#L676-1 assume !false; 138527#L546 start_simulation_~kernel_st~0 := 1;havoc eval_#t~nondet7, eval_#t~nondet8, eval_#t~nondet9, eval_#t~nondet10, eval_#t~nondet11, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0, eval_~tmp___3~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0;havoc eval_~tmp___3~0; 145219#L381 [2020-10-20 08:04:05,684 INFO L796 eck$LassoCheckResult]: Loop: 145219#L381 assume !false; 151837#L299 assume 0 == ~wl_st~0; 151835#L312-1 assume 0 == ~wl_st~0;eval_~tmp~0 := eval_#t~nondet7;havoc eval_#t~nondet7; 151831#L325 assume !(0 != eval_~tmp~0); 151829#L321 assume 0 == ~c1_st~0;eval_~tmp___0~0 := eval_#t~nondet8;havoc eval_#t~nondet8; 151783#L340 assume !(0 != eval_~tmp___0~0); 151827#L336 assume 0 == ~c2_st~0;eval_~tmp___1~0 := eval_#t~nondet9;havoc eval_#t~nondet9; 151813#L355 assume !(0 != eval_~tmp___1~0); 151826#L351 assume 0 == ~wb_st~0;eval_~tmp___2~0 := eval_#t~nondet10;havoc eval_#t~nondet10; 151843#L370 assume !(0 != eval_~tmp___2~0); 151842#L366 assume !(0 == ~r_st~0); 145219#L381 [2020-10-20 08:04:05,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:05,684 INFO L82 PathProgramCache]: Analyzing trace with hash 823350777, now seen corresponding path program 4 times [2020-10-20 08:04:05,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:05,685 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923734605] [2020-10-20 08:04:05,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,691 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,703 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:05,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2049695563, now seen corresponding path program 1 times [2020-10-20 08:04:05,704 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:05,704 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907866588] [2020-10-20 08:04:05,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,708 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,710 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:05,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:04:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1793187773, now seen corresponding path program 1 times [2020-10-20 08:04:05,710 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:04:05,711 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230493674] [2020-10-20 08:04:05,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:04:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:04:05,724 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:04:05,731 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:04:06,774 WARN L193 SmtUtils]: Spent 979.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 157 [2020-10-20 08:04:06,981 WARN L193 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2020-10-20 08:04:07,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:04:07 BoogieIcfgContainer [2020-10-20 08:04:07,021 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:04:07,021 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:04:07,021 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:04:07,022 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:04:07,022 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:03:52" (3/4) ... [2020-10-20 08:04:07,025 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-10-20 08:04:07,083 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 08:04:07,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:04:07,084 INFO L168 Benchmark]: Toolchain (without parser) took 15647.60 ms. Allocated memory was 36.2 MB in the beginning and 273.7 MB in the end (delta: 237.5 MB). Free memory was 9.7 MB in the beginning and 95.1 MB in the end (delta: -85.5 MB). Peak memory consumption was 152.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,085 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 36.2 MB. Free memory was 15.0 MB in the beginning and 14.9 MB in the end (delta: 73.7 kB). Peak memory consumption was 73.7 kB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.85 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 8.8 MB in the beginning and 22.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 7.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.24 ms. Allocated memory is still 44.6 MB. Free memory was 22.4 MB in the beginning and 19.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,086 INFO L168 Benchmark]: Boogie Preprocessor took 39.22 ms. Allocated memory is still 44.6 MB. Free memory was 19.9 MB in the beginning and 17.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,086 INFO L168 Benchmark]: RCFGBuilder took 758.62 ms. Allocated memory was 44.6 MB in the beginning and 49.8 MB in the end (delta: 5.2 MB). Free memory was 17.5 MB in the beginning and 32.8 MB in the end (delta: -15.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,087 INFO L168 Benchmark]: BuchiAutomizer took 14197.93 ms. Allocated memory was 49.8 MB in the beginning and 273.7 MB in the end (delta: 223.9 MB). Free memory was 32.8 MB in the beginning and 100.1 MB in the end (delta: -67.3 MB). Peak memory consumption was 198.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,087 INFO L168 Benchmark]: Witness Printer took 61.67 ms. Allocated memory is still 273.7 MB. Free memory was 100.1 MB in the beginning and 95.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:04:07,090 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 36.2 MB. Free memory was 15.0 MB in the beginning and 14.9 MB in the end (delta: 73.7 kB). Peak memory consumption was 73.7 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 523.85 ms. Allocated memory was 36.2 MB in the beginning and 44.6 MB in the end (delta: 8.4 MB). Free memory was 8.8 MB in the beginning and 22.4 MB in the end (delta: -13.6 MB). Peak memory consumption was 7.0 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 55.24 ms. Allocated memory is still 44.6 MB. Free memory was 22.4 MB in the beginning and 19.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 39.22 ms. Allocated memory is still 44.6 MB. Free memory was 19.9 MB in the beginning and 17.5 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 14.3 GB. * RCFGBuilder took 758.62 ms. Allocated memory was 44.6 MB in the beginning and 49.8 MB in the end (delta: 5.2 MB). Free memory was 17.5 MB in the beginning and 32.8 MB in the end (delta: -15.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 14197.93 ms. Allocated memory was 49.8 MB in the beginning and 273.7 MB in the end (delta: 223.9 MB). Free memory was 32.8 MB in the beginning and 100.1 MB in the end (delta: -67.3 MB). Peak memory consumption was 198.9 MB. Max. memory is 14.3 GB. * Witness Printer took 61.67 ms. Allocated memory is still 273.7 MB. Free memory was 100.1 MB in the beginning and 95.1 MB in the end (delta: 5.0 MB). Peak memory consumption was 5.0 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 17 terminating modules (14 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_c + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * e_e + 1 and consists of 3 locations. 14 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 22109 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.1s and 15 iterations. TraceHistogramMax:1. Analysis of lassos took 7.3s. Construction of modules took 0.5s. Büchi inclusion checks took 1.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 15. Automata minimization 2.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 733 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had 22109 states and ocurred in iteration 14. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 4465 SDtfs, 4029 SDslu, 2543 SDs, 0 SdLazy, 370 SolverSat, 113 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc3 concLT1 SILN1 SILU0 SILI6 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital81 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq185 hnf96 smp100 dnf170 smp87 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 23ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 14 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 298]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {wb_st=0, NULL=0, NULL=1, c2_st=0, tmp=0, e_c=2, e_e=2, e_p_in=0, kernel_st=1, t_b=0, tmp___2=0, wb_pc=0, tmp___0=0, wb_i=1, c_t=0, NULL=0, NULL=0, c=0, wl_st=0, c2_pc=0, r_i=0, e_f=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3ee51958=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1bb1b2d2=0, NULL=0, r_st=2, __retres1=0, p_out=0, NULL=3, processed=0, \result=0, wl_pc=0, e_wl=2, tmp___1=0, data=0, p_in=0, tmp___3=0, c_req_up=0, NULL=2, wl_i=1, NULL=0, c1_st=0, NULL=4, c1_i=1, c2_i=1, d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7ff88754=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@426965cf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6959951b=0, e_g=2, c1_pc=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 298]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L20] int c ; [L21] int c_t ; [L22] int c_req_up ; [L23] int p_in ; [L24] int p_out ; [L25] int wl_st ; [L26] int c1_st ; [L27] int c2_st ; [L28] int wb_st ; [L29] int r_st ; [L30] int wl_i ; [L31] int c1_i ; [L32] int c2_i ; [L33] int wb_i ; [L34] int r_i ; [L35] int wl_pc ; [L36] int c1_pc ; [L37] int c2_pc ; [L38] int wb_pc ; [L39] int e_e ; [L40] int e_f ; [L41] int e_g ; [L42] int e_c ; [L43] int e_p_in ; [L44] int e_wl ; [L50] int d ; [L51] int data ; [L52] int processed ; [L53] static int t_b ; [L693] int __retres1 ; [L697] e_wl = 2 [L698] e_c = e_wl [L699] e_g = e_c [L700] e_f = e_g [L701] e_e = e_f [L702] wl_pc = 0 [L703] c1_pc = 0 [L704] c2_pc = 0 [L705] wb_pc = 0 [L706] wb_i = 1 [L707] c2_i = wb_i [L708] c1_i = c2_i [L709] wl_i = c1_i [L710] r_i = 0 [L711] c_req_up = 0 [L712] d = 0 [L713] c = 0 [L404] int kernel_st ; [L407] kernel_st = 0 [L408] COND FALSE !((int )c_req_up == 1) [L419] COND TRUE (int )wl_i == 1 [L420] wl_st = 0 [L424] COND TRUE (int )c1_i == 1 [L425] c1_st = 0 [L429] COND TRUE (int )c2_i == 1 [L430] c2_st = 0 [L434] COND TRUE (int )wb_i == 1 [L435] wb_st = 0 [L439] COND FALSE !((int )r_i == 1) [L442] r_st = 2 [L444] COND FALSE !((int )e_f == 0) [L449] COND FALSE !((int )e_g == 0) [L454] COND FALSE !((int )e_e == 0) [L459] COND FALSE !((int )e_c == 0) [L464] COND FALSE !((int )e_wl == 0) [L469] COND FALSE !((int )wl_pc == 1) [L477] COND FALSE !((int )wl_pc == 2) [L487] COND FALSE !((int )c1_pc == 1) [L496] COND FALSE !((int )c2_pc == 1) [L505] COND FALSE !((int )wb_pc == 1) [L514] COND FALSE !((int )e_c == 1) [L519] COND FALSE !((int )e_e == 1) [L524] COND FALSE !((int )e_f == 1) [L529] COND FALSE !((int )e_g == 1) [L534] COND FALSE !((int )e_c == 1) [L539] COND FALSE !((int )e_wl == 1) [L545] COND TRUE 1 [L548] kernel_st = 1 [L290] int tmp ; [L291] int tmp___0 ; [L292] int tmp___1 ; [L293] int tmp___2 ; [L294] int tmp___3 ; Loop: [L298] COND TRUE 1 [L300] COND TRUE (int )wl_st == 0 [L321] COND TRUE (int )wl_st == 0 [L323] tmp = __VERIFIER_nondet_int() [L325] COND FALSE !(\read(tmp)) [L336] COND TRUE (int )c1_st == 0 [L338] tmp___0 = __VERIFIER_nondet_int() [L340] COND FALSE !(\read(tmp___0)) [L351] COND TRUE (int )c2_st == 0 [L353] tmp___1 = __VERIFIER_nondet_int() [L355] COND FALSE !(\read(tmp___1)) [L366] COND TRUE (int )wb_st == 0 [L368] tmp___2 = __VERIFIER_nondet_int() [L370] COND FALSE !(\read(tmp___2)) [L381] COND FALSE !((int )r_st == 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...