./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.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/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.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 b725ab56a0ee729a1a2518c15cfcbd3adcfb0076 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 08:09:52,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 08:09:52,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 08:09:52,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 08:09:52,971 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 08:09:52,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 08:09:52,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 08:09:52,986 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 08:09:52,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 08:09:52,999 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 08:09:53,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 08:09:53,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 08:09:53,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 08:09:53,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 08:09:53,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 08:09:53,013 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 08:09:53,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 08:09:53,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 08:09:53,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 08:09:53,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 08:09:53,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 08:09:53,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 08:09:53,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 08:09:53,033 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 08:09:53,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 08:09:53,047 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 08:09:53,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 08:09:53,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 08:09:53,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 08:09:53,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 08:09:53,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 08:09:53,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 08:09:53,059 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 08:09:53,060 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 08:09:53,060 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 08:09:53,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 08:09:53,061 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 08:09:53,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 08:09:53,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 08:09:53,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 08:09:53,068 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 08:09:53,070 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:09:53,115 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 08:09:53,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 08:09:53,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 08:09:53,118 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 08:09:53,119 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 08:09:53,119 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 08:09:53,119 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 08:09:53,119 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 08:09:53,120 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 08:09:53,120 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 08:09:53,121 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 08:09:53,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 08:09:53,121 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 08:09:53,122 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 08:09:53,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 08:09:53,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 08:09:53,123 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 08:09:53,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 08:09:53,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 08:09:53,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 08:09:53,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 08:09:53,124 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 08:09:53,124 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 08:09:53,125 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 08:09:53,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 08:09:53,125 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 08:09:53,125 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 08:09:53,126 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 08:09:53,126 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 08:09:53,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 08:09:53,126 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 08:09:53,127 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 08:09:53,128 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 08:09:53,128 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 -> b725ab56a0ee729a1a2518c15cfcbd3adcfb0076 [2020-10-20 08:09:53,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 08:09:53,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 08:09:53,420 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 08:09:53,422 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 08:09:53,422 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 08:09:53,423 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-10-20 08:09:53,482 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13707a98a/f4fcca102ae243828eba1cb96486330c/FLAG03f7866ed [2020-10-20 08:09:53,925 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 08:09:53,926 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-10-20 08:09:53,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13707a98a/f4fcca102ae243828eba1cb96486330c/FLAG03f7866ed [2020-10-20 08:09:54,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13707a98a/f4fcca102ae243828eba1cb96486330c [2020-10-20 08:09:54,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 08:09:54,328 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 08:09:54,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 08:09:54,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 08:09:54,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 08:09:54,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e32c08a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54, skipping insertion in model container [2020-10-20 08:09:54,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 08:09:54,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 08:09:54,764 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:09:54,777 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 08:09:54,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 08:09:54,840 INFO L208 MainTranslator]: Completed translation [2020-10-20 08:09:54,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54 WrapperNode [2020-10-20 08:09:54,841 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 08:09:54,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 08:09:54,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 08:09:54,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 08:09:54,851 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:09:54" (1/1) ... [2020-10-20 08:09:54,862 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:09:54" (1/1) ... [2020-10-20 08:09:54,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 08:09:54,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 08:09:54,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 08:09:54,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 08:09:54,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,906 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,931 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (1/1) ... [2020-10-20 08:09:54,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 08:09:54,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 08:09:54,941 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 08:09:54,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 08:09:54,942 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (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:09:55,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 08:09:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 08:09:55,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 08:09:55,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 08:09:55,536 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 08:09:55,537 INFO L298 CfgBuilder]: Removed 19 assume(true) statements. [2020-10-20 08:09:55,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:09:55 BoogieIcfgContainer [2020-10-20 08:09:55,539 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 08:09:55,540 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 08:09:55,540 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 08:09:55,543 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 08:09:55,544 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:09:55,544 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 08:09:54" (1/3) ... [2020-10-20 08:09:55,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18b25bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:09:55, skipping insertion in model container [2020-10-20 08:09:55,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:09:55,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 08:09:54" (2/3) ... [2020-10-20 08:09:55,547 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@18b25bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 08:09:55, skipping insertion in model container [2020-10-20 08:09:55,547 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 08:09:55,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:09:55" (3/3) ... [2020-10-20 08:09:55,549 INFO L373 chiAutomizerObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals.c [2020-10-20 08:09:55,596 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 08:09:55,597 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 08:09:55,597 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 08:09:55,597 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 08:09:55,598 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 08:09:55,598 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 08:09:55,598 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 08:09:55,599 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 08:09:55,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-10-20 08:09:55,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-10-20 08:09:55,641 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:09:55,641 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:09:55,650 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:09:55,651 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:09:55,651 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 08:09:55,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 62 states. [2020-10-20 08:09:55,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2020-10-20 08:09:55,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:09:55,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:09:55,658 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:09:55,658 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:09:55,666 INFO L794 eck$LassoCheckResult]: Stem: 23#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(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 7#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 32#L177true assume !(0 == ~r1~0);init_~tmp~0 := 0; 29#L177-1true init_#res := init_~tmp~0; 20#L242true main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 31#L294true assume !(0 == main_~i2~0); 43#L294-2true ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 60#L302-2true [2020-10-20 08:09:55,667 INFO L796 eck$LassoCheckResult]: Loop: 60#L302-2true assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 44#L101true assume !(0 != ~mode1~0 % 256); 35#L115true assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 33#L115-2true ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 63#L101-2true havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 8#L127true assume !(0 != ~mode2~0 % 256); 40#L140true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 39#L140-2true ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 50#L127-2true havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 62#L152true assume !(0 != ~mode3~0 % 256); 18#L165true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 26#L165-2true ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 58#L152-2true ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 28#L250true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 42#L250-1true check_#res := check_~tmp~1; 17#L270true main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25#L326true assume !(0 == assert_~arg % 256); 4#L321true main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 60#L302-2true [2020-10-20 08:09:55,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1892699938, now seen corresponding path program 1 times [2020-10-20 08:09:55,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:55,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442303358] [2020-10-20 08:09:55,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:09:55,891 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:09:55,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442303358] [2020-10-20 08:09:55,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:09:55,893 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:09:55,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550049466] [2020-10-20 08:09:55,900 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 08:09:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:55,901 INFO L82 PathProgramCache]: Analyzing trace with hash -541680368, now seen corresponding path program 1 times [2020-10-20 08:09:55,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:55,901 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675281796] [2020-10-20 08:09:55,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:55,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:09:56,041 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:09:56,041 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675281796] [2020-10-20 08:09:56,041 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:09:56,042 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:09:56,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433198010] [2020-10-20 08:09:56,044 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:09:56,045 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:09:56,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:09:56,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:09:56,064 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 5 states. [2020-10-20 08:09:56,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:09:56,183 INFO L93 Difference]: Finished difference Result 99 states and 154 transitions. [2020-10-20 08:09:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 08:09:56,186 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 154 transitions. [2020-10-20 08:09:56,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-10-20 08:09:56,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 90 states and 130 transitions. [2020-10-20 08:09:56,198 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 90 [2020-10-20 08:09:56,199 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 90 [2020-10-20 08:09:56,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 130 transitions. [2020-10-20 08:09:56,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:09:56,201 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 130 transitions. [2020-10-20 08:09:56,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 130 transitions. [2020-10-20 08:09:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 56. [2020-10-20 08:09:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 08:09:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 76 transitions. [2020-10-20 08:09:56,236 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-10-20 08:09:56,237 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 76 transitions. [2020-10-20 08:09:56,237 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 08:09:56,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 76 transitions. [2020-10-20 08:09:56,238 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-10-20 08:09:56,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:09:56,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:09:56,240 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] [2020-10-20 08:09:56,240 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 08:09:56,240 INFO L794 eck$LassoCheckResult]: Stem: 211#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(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 193#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 194#L177 assume 0 == ~r1~0; 223#L178 assume ~id1~0 >= 0; 183#L179 assume 0 == ~st1~0; 184#L180 assume ~send1~0 == ~id1~0; 209#L181 assume 0 == ~mode1~0 % 256; 195#L182 assume ~id2~0 >= 0; 196#L183 assume 0 == ~st2~0; 212#L184 assume ~send2~0 == ~id2~0; 230#L185 assume 0 == ~mode2~0 % 256; 179#L186 assume ~id3~0 >= 0; 180#L187 assume 0 == ~st3~0; 206#L188 assume ~send3~0 == ~id3~0; 224#L189 assume 0 == ~mode3~0 % 256; 185#L190 assume ~id1~0 != ~id2~0; 186#L191 assume ~id1~0 != ~id3~0; 227#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 217#L177-1 init_#res := init_~tmp~0; 207#L242 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 208#L294 assume !(0 == main_~i2~0); 220#L294-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 182#L302-2 [2020-10-20 08:09:56,241 INFO L796 eck$LassoCheckResult]: Loop: 182#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 231#L101 assume !(0 != ~mode1~0 % 256); 225#L115 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 221#L115-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 222#L101-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 190#L127 assume !(0 != ~mode2~0 % 256); 192#L140 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite8 := ~send2~0; 228#L140-2 ~p2_new~0 := (if node2_#t~ite8 % 256 <= 127 then node2_#t~ite8 % 256 else node2_#t~ite8 % 256 - 256);havoc node2_#t~ite8;~mode2~0 := 1; 229#L127-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 234#L152 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 218#L155 assume !(node3_~m3~0 != ~nomsg~0); 216#L155-1 ~mode3~0 := 0; 213#L152-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 214#L250 assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1 := 0; 188#L250-1 check_#res := check_~tmp~1; 202#L270 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 203#L326 assume !(0 == assert_~arg % 256); 181#L321 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 182#L302-2 [2020-10-20 08:09:56,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 1 times [2020-10-20 08:09:56,241 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622231569] [2020-10-20 08:09:56,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,274 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,306 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,345 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:09:56,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1759665766, now seen corresponding path program 1 times [2020-10-20 08:09:56,346 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,347 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073723270] [2020-10-20 08:09:56,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:09:56,462 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:09:56,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073723270] [2020-10-20 08:09:56,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:09:56,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:09:56,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251741961] [2020-10-20 08:09:56,464 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:09:56,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:09:56,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 08:09:56,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 08:09:56,465 INFO L87 Difference]: Start difference. First operand 56 states and 76 transitions. cyclomatic complexity: 21 Second operand 5 states. [2020-10-20 08:09:56,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:09:56,524 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2020-10-20 08:09:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 08:09:56,526 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2020-10-20 08:09:56,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-10-20 08:09:56,529 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 73 transitions. [2020-10-20 08:09:56,529 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2020-10-20 08:09:56,529 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2020-10-20 08:09:56,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 73 transitions. [2020-10-20 08:09:56,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:09:56,530 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-10-20 08:09:56,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 73 transitions. [2020-10-20 08:09:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2020-10-20 08:09:56,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-20 08:09:56,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 73 transitions. [2020-10-20 08:09:56,536 INFO L714 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-10-20 08:09:56,536 INFO L594 BuchiCegarLoop]: Abstraction has 56 states and 73 transitions. [2020-10-20 08:09:56,536 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 08:09:56,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 73 transitions. [2020-10-20 08:09:56,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2020-10-20 08:09:56,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:09:56,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:09:56,539 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] [2020-10-20 08:09:56,539 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] [2020-10-20 08:09:56,540 INFO L794 eck$LassoCheckResult]: Stem: 338#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(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 320#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 321#L177 assume 0 == ~r1~0; 350#L178 assume ~id1~0 >= 0; 310#L179 assume 0 == ~st1~0; 311#L180 assume ~send1~0 == ~id1~0; 336#L181 assume 0 == ~mode1~0 % 256; 322#L182 assume ~id2~0 >= 0; 323#L183 assume 0 == ~st2~0; 339#L184 assume ~send2~0 == ~id2~0; 357#L185 assume 0 == ~mode2~0 % 256; 306#L186 assume ~id3~0 >= 0; 307#L187 assume 0 == ~st3~0; 333#L188 assume ~send3~0 == ~id3~0; 351#L189 assume 0 == ~mode3~0 % 256; 312#L190 assume ~id1~0 != ~id2~0; 313#L191 assume ~id1~0 != ~id3~0; 354#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 344#L177-1 init_#res := init_~tmp~0; 334#L242 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 335#L294 assume !(0 == main_~i2~0); 347#L294-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 309#L302-2 [2020-10-20 08:09:56,540 INFO L796 eck$LassoCheckResult]: Loop: 309#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 358#L101 assume !(0 != ~mode1~0 % 256); 352#L115 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 348#L115-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 349#L101-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 314#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 315#L130 assume !(node2_~m2~0 != ~nomsg~0); 328#L130-1 ~mode2~0 := 0; 356#L127-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 361#L152 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 345#L155 assume !(node3_~m3~0 != ~nomsg~0); 341#L155-1 ~mode3~0 := 0; 340#L152-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 342#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 343#L251 assume ~r1~0 >= 3; 317#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 318#L250-1 check_#res := check_~tmp~1; 329#L270 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 330#L326 assume !(0 == assert_~arg % 256); 308#L321 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 309#L302-2 [2020-10-20 08:09:56,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 2 times [2020-10-20 08:09:56,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235278366] [2020-10-20 08:09:56,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,568 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,597 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,618 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:09:56,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1560733460, now seen corresponding path program 1 times [2020-10-20 08:09:56,622 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,622 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619354320] [2020-10-20 08:09:56,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:09:56,672 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:09:56,673 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619354320] [2020-10-20 08:09:56,673 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:09:56,673 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 08:09:56,674 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856421146] [2020-10-20 08:09:56,674 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 08:09:56,674 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:09:56,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 08:09:56,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 08:09:56,675 INFO L87 Difference]: Start difference. First operand 56 states and 73 transitions. cyclomatic complexity: 18 Second operand 3 states. [2020-10-20 08:09:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:09:56,702 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2020-10-20 08:09:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 08:09:56,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 113 transitions. [2020-10-20 08:09:56,705 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-10-20 08:09:56,706 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 113 transitions. [2020-10-20 08:09:56,706 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 84 [2020-10-20 08:09:56,706 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 84 [2020-10-20 08:09:56,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 113 transitions. [2020-10-20 08:09:56,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:09:56,708 INFO L691 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-10-20 08:09:56,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 113 transitions. [2020-10-20 08:09:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2020-10-20 08:09:56,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-20 08:09:56,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 113 transitions. [2020-10-20 08:09:56,714 INFO L714 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-10-20 08:09:56,715 INFO L594 BuchiCegarLoop]: Abstraction has 84 states and 113 transitions. [2020-10-20 08:09:56,715 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 08:09:56,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 84 states and 113 transitions. [2020-10-20 08:09:56,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 62 [2020-10-20 08:09:56,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 08:09:56,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 08:09:56,718 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] [2020-10-20 08:09:56,718 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] [2020-10-20 08:09:56,718 INFO L794 eck$LassoCheckResult]: Stem: 484#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(32);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset]; 465#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~nondet11, main_#t~nondet12, main_#t~nondet13, main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~nondet21, main_#t~nondet22, main_#t~ret23, main_#t~ret24, main_#t~post25, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id1~0 := main_#t~nondet11;havoc main_#t~nondet11;~st1~0 := main_#t~nondet12;havoc main_#t~nondet12;~send1~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode1~0 := main_#t~nondet14;havoc main_#t~nondet14;~id2~0 := main_#t~nondet15;havoc main_#t~nondet15;~st2~0 := main_#t~nondet16;havoc main_#t~nondet16;~send2~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode2~0 := main_#t~nondet18;havoc main_#t~nondet18;~id3~0 := main_#t~nondet19;havoc main_#t~nondet19;~st3~0 := main_#t~nondet20;havoc main_#t~nondet20;~send3~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode3~0 := main_#t~nondet22;havoc main_#t~nondet22;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 466#L177 assume 0 == ~r1~0; 496#L178 assume ~id1~0 >= 0; 456#L179 assume 0 == ~st1~0; 457#L180 assume ~send1~0 == ~id1~0; 482#L181 assume 0 == ~mode1~0 % 256; 467#L182 assume ~id2~0 >= 0; 468#L183 assume 0 == ~st2~0; 485#L184 assume ~send2~0 == ~id2~0; 504#L185 assume 0 == ~mode2~0 % 256; 452#L186 assume ~id3~0 >= 0; 453#L187 assume 0 == ~st3~0; 479#L188 assume ~send3~0 == ~id3~0; 497#L189 assume 0 == ~mode3~0 % 256; 458#L190 assume ~id1~0 != ~id2~0; 459#L191 assume ~id1~0 != ~id3~0; 501#L192 assume ~id2~0 != ~id3~0;init_~tmp~0 := 1; 490#L177-1 init_#res := init_~tmp~0; 480#L242 main_#t~ret23 := init_#res;main_~i2~0 := main_#t~ret23;havoc main_#t~ret23; 481#L294 assume !(0 == main_~i2~0); 493#L294-2 ~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;main_~i2~0 := 0; 455#L302-2 [2020-10-20 08:09:56,719 INFO L796 eck$LassoCheckResult]: Loop: 455#L302-2 assume !!(main_~i2~0 < 6);havoc node1_#t~ite7, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 506#L101 assume !(0 != ~mode1~0 % 256); 498#L115 assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite7 := ~p1_new~0; 494#L115-2 ~p1_new~0 := (if node1_#t~ite7 % 256 <= 127 then node1_#t~ite7 % 256 else node1_#t~ite7 % 256 - 256);havoc node1_#t~ite7;~mode1~0 := 1; 495#L101-2 havoc node2_#t~ite8, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 460#L127 assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 461#L130 assume !(node2_~m2~0 != ~nomsg~0); 473#L130-1 ~mode2~0 := 0; 503#L127-2 havoc node3_#t~ite9, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 520#L152 assume !(0 != ~mode3~0 % 256); 516#L165 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite9 := ~send3~0; 514#L165-2 ~p3_new~0 := (if node3_#t~ite9 % 256 <= 127 then node3_#t~ite9 % 256 else node3_#t~ite9 % 256 - 256);havoc node3_#t~ite9;~mode3~0 := 1; 513#L152-2 ~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 512#L250 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 511#L251 assume !(~r1~0 >= 3); 499#L254 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 500#L255 assume ~r1~0 < 3;check_~tmp~1 := 1; 505#L250-1 check_#res := check_~tmp~1; 475#L270 main_#t~ret24 := check_#res;main_~c1~0 := main_#t~ret24;havoc main_#t~ret24;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 476#L326 assume !(0 == assert_~arg % 256); 454#L321 main_#t~post25 := main_~i2~0;main_~i2~0 := 1 + main_#t~post25;havoc main_#t~post25; 455#L302-2 [2020-10-20 08:09:56,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1473464705, now seen corresponding path program 3 times [2020-10-20 08:09:56,720 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,720 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78015161] [2020-10-20 08:09:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,748 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,764 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,774 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:09:56,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,775 INFO L82 PathProgramCache]: Analyzing trace with hash -391025173, now seen corresponding path program 1 times [2020-10-20 08:09:56,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066430336] [2020-10-20 08:09:56,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,787 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 08:09:56,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 08:09:56,808 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 08:09:56,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:09:56,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1669049811, now seen corresponding path program 1 times [2020-10-20 08:09:56,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 08:09:56,812 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114486142] [2020-10-20 08:09:56,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 08:09:56,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:09:56,886 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:09:56,887 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114486142] [2020-10-20 08:09:56,887 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 08:09:56,887 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 08:09:56,888 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778524380] [2020-10-20 08:09:57,241 WARN L193 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 102 [2020-10-20 08:09:57,604 WARN L193 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 96 [2020-10-20 08:09:57,617 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:09:57,618 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:09:57,618 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:09:57,618 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:09:57,619 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-10-20 08:09:57,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:09:57,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:09:57,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:09:57,620 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-20 08:09:57,620 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:09:57,620 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:09:57,647 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:09:57,661 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:09:57,669 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:09:57,827 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-10-20 08:09:57,828 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:09:57,831 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:09:57,837 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:09:57,841 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:09:57,844 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:09:57,851 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:09:57,855 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:09:57,858 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:09:57,864 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:09:57,867 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:09:57,870 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:09:57,876 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:09:57,879 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:09:57,881 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:09:57,884 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:09:57,887 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:09:57,890 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:09:58,079 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-20 08:09:58,192 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-20 08:10:04,388 WARN L193 SmtUtils]: Spent 6.14 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-10-20 08:10:04,512 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:10:04,513 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:10:04,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-10-20 08:10:04,521 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:10:04,550 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-10-20 08:10:04,550 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-10-20 08:10:04,586 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-10-20 08:10:04,588 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 08:10:04,588 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 08:10:04,588 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 08:10:04,588 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 08:10:04,588 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 08:10:04,589 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:10:04,589 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 08:10:04,589 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 08:10:04,589 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2020-10-20 08:10:04,589 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 08:10:04,589 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 08:10:04,601 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:10:04,611 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:10:04,616 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:10:04,619 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:10:04,621 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:10:04,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:10:04,630 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:10:04,633 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:10:04,636 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:10:04,639 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:10:04,642 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:10:04,785 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2020-10-20 08:10:04,786 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:10:04,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:10:04,797 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:10:04,805 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:10:04,812 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:10:04,814 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:10:04,819 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:10:04,821 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:10:04,825 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:10:05,067 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-10-20 08:10:05,136 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2020-10-20 08:10:10,954 WARN L193 SmtUtils]: Spent 5.76 s on a formula simplification. DAG size of input: 175 DAG size of output: 103 [2020-10-20 08:10:11,023 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 08:10:11,027 INFO L489 LassoAnalysis]: Using template 'affine'. 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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:10:11,032 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:10:11,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 08:10:11,034 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 08:10:11,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 08:10:11,035 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 08:10:11,035 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 08:10:11,037 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 08:10:11,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 08:10:11,045 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 08:10:11,063 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-10-20 08:10:11,064 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 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 08:10:11,076 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 08:10:11,076 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-10-20 08:10:11,077 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 08:10:11,077 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 11 Supporting invariants [] [2020-10-20 08:10:11,145 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-10-20 08:10:11,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 08:10:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:10:11,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 08:10:11,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:10:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 08:10:11,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 08:10:11,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 08:10:11,294 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:10:11,298 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 08:10:11,299 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30 Second operand 3 states. [2020-10-20 08:10:11,352 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 84 states and 113 transitions. cyclomatic complexity: 30. Second operand 3 states. Result 145 states and 204 transitions. Complement of second has 4 states. [2020-10-20 08:10:11,353 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:10:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 08:10:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2020-10-20 08:10:11,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 21 letters. [2020-10-20 08:10:11,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:10:11,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 43 letters. Loop has 21 letters. [2020-10-20 08:10:11,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:10:11,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 73 transitions. Stem has 22 letters. Loop has 42 letters. [2020-10-20 08:10:11,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 08:10:11,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 145 states and 204 transitions. [2020-10-20 08:10:11,362 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:10:11,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 145 states to 0 states and 0 transitions. [2020-10-20 08:10:11,363 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:10:11,363 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:10:11,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:10:11,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:10:11,364 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:10:11,364 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:10:11,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 08:10:11,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 08:10:11,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-10-20 08:10:11,365 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 6 states. [2020-10-20 08:10:11,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 08:10:11,366 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-10-20 08:10:11,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 08:10:11,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-10-20 08:10:11,366 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:10:11,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-10-20 08:10:11,367 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 08:10:11,367 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 08:10:11,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 08:10:11,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 08:10:11,367 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:10:11,368 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:10:11,368 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 08:10:11,368 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 08:10:11,368 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 08:10:11,368 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 08:10:11,369 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 08:10:11,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 08:10:11 BoogieIcfgContainer [2020-10-20 08:10:11,376 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 08:10:11,376 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 08:10:11,376 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 08:10:11,377 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 08:10:11,377 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 08:09:55" (3/4) ... [2020-10-20 08:10:11,381 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 08:10:11,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 08:10:11,384 INFO L168 Benchmark]: Toolchain (without parser) took 17060.45 ms. Allocated memory was 35.1 MB in the beginning and 128.5 MB in the end (delta: 93.3 MB). Free memory was 11.9 MB in the beginning and 18.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 86.4 MB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,385 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.5 kB). Peak memory consumption was 29.5 kB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 511.95 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 11.1 MB in the beginning and 23.3 MB in the end (delta: -12.3 MB). Peak memory consumption was 8.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.93 ms. Allocated memory is still 43.5 MB. Free memory was 23.3 MB in the beginning and 21.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,387 INFO L168 Benchmark]: Boogie Preprocessor took 45.29 ms. Allocated memory is still 43.5 MB. Free memory was 21.1 MB in the beginning and 19.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,388 INFO L168 Benchmark]: RCFGBuilder took 599.83 ms. Allocated memory was 43.5 MB in the beginning and 46.7 MB in the end (delta: 3.1 MB). Free memory was 19.3 MB in the beginning and 22.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,389 INFO L168 Benchmark]: BuchiAutomizer took 15836.34 ms. Allocated memory was 46.7 MB in the beginning and 128.5 MB in the end (delta: 81.8 MB). Free memory was 21.9 MB in the beginning and 18.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 84.9 MB. Max. memory is 14.3 GB. [2020-10-20 08:10:11,390 INFO L168 Benchmark]: Witness Printer took 5.57 ms. Allocated memory is still 128.5 MB. Free memory is still 18.8 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 08:10:11,395 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 34.1 MB. Free memory was 19.3 MB in the beginning and 19.3 MB in the end (delta: 29.5 kB). Peak memory consumption was 29.5 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 511.95 ms. Allocated memory was 35.1 MB in the beginning and 43.5 MB in the end (delta: 8.4 MB). Free memory was 11.1 MB in the beginning and 23.3 MB in the end (delta: -12.3 MB). Peak memory consumption was 8.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 51.93 ms. Allocated memory is still 43.5 MB. Free memory was 23.3 MB in the beginning and 21.1 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 45.29 ms. Allocated memory is still 43.5 MB. Free memory was 21.1 MB in the beginning and 19.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * RCFGBuilder took 599.83 ms. Allocated memory was 43.5 MB in the beginning and 46.7 MB in the end (delta: 3.1 MB). Free memory was 19.3 MB in the beginning and 22.2 MB in the end (delta: -3.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 15836.34 ms. Allocated memory was 46.7 MB in the beginning and 128.5 MB in the end (delta: 81.8 MB). Free memory was 21.9 MB in the beginning and 18.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 84.9 MB. Max. memory is 14.3 GB. * Witness Printer took 5.57 ms. Allocated memory is still 128.5 MB. Free memory is still 18.8 MB. There was no memory consumed. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.7s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 15.1s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 34 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 84 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 347 SDtfs, 219 SDslu, 585 SDs, 0 SdLazy, 46 SolverSat, 23 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital151 mio100 ax123 hnf104 lsp69 ukn64 mio100 lsp100 div169 bol100 ite100 ukn100 eq166 hnf68 smp100 dnf7015 smp23 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 48ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...