./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer --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 bd200d2db4e8741128c4082e326a133517d9c82f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 12:56:11,151 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:56:11,152 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:56:11,159 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:56:11,159 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:56:11,160 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:56:11,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:56:11,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:56:11,163 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:56:11,163 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:56:11,164 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:56:11,164 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:56:11,165 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:56:11,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:56:11,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:56:11,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:56:11,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:56:11,169 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:56:11,170 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:56:11,171 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:56:11,172 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:56:11,173 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:56:11,174 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:56:11,175 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:56:11,175 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:56:11,175 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:56:11,176 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:56:11,177 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:56:11,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:56:11,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:56:11,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:56:11,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:56:11,179 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:56:11,179 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:56:11,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:56:11,180 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:56:11,180 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 12:56:11,191 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:56:11,191 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:56:11,192 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:56:11,192 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:56:11,192 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:56:11,193 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 12:56:11,193 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 12:56:11,193 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 12:56:11,193 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 12:56:11,193 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 12:56:11,193 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 12:56:11,193 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 12:56:11,194 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 12:56:11,195 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:56:11,195 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:56:11,195 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 12:56:11,195 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:56:11,195 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 12:56:11,195 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:56:11,195 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:56:11,196 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 12:56:11,196 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:56:11,196 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:56:11,196 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 12:56:11,197 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 12:56:11,197 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer 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 -> bd200d2db4e8741128c4082e326a133517d9c82f [2018-11-23 12:56:11,218 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:56:11,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:56:11,230 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:56:11,231 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:56:11,232 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:56:11,232 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-23 12:56:11,274 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/data/853f94b52/2c668a30dda9471e997c2d46a2f359c8/FLAG8e20de54d [2018-11-23 12:56:11,709 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:56:11,709 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/sv-benchmarks/c/seq-mthreaded/pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-23 12:56:11,718 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/data/853f94b52/2c668a30dda9471e997c2d46a2f359c8/FLAG8e20de54d [2018-11-23 12:56:11,728 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/data/853f94b52/2c668a30dda9471e997c2d46a2f359c8 [2018-11-23 12:56:11,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:56:11,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:56:11,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:11,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:56:11,734 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:56:11,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:11" (1/1) ... [2018-11-23 12:56:11,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b4f4658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:11, skipping insertion in model container [2018-11-23 12:56:11,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:56:11" (1/1) ... [2018-11-23 12:56:11,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:56:11,771 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:56:11,931 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:11,937 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:56:11,975 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:56:12,027 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:56:12,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12 WrapperNode [2018-11-23 12:56:12,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:56:12,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:12,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:56:12,028 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:56:12,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,040 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,062 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:56:12,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:56:12,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:56:12,063 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:56:12,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,071 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,078 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... [2018-11-23 12:56:12,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:56:12,086 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:56:12,086 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:56:12,086 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:56:12,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/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 [2018-11-23 12:56:12,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:56:12,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:56:12,543 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:56:12,544 INFO L280 CfgBuilder]: Removed 23 assue(true) statements. [2018-11-23 12:56:12,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:12 BoogieIcfgContainer [2018-11-23 12:56:12,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:56:12,544 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 12:56:12,544 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 12:56:12,547 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 12:56:12,547 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:56:12,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:56:11" (1/3) ... [2018-11-23 12:56:12,548 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132c728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:56:12, skipping insertion in model container [2018-11-23 12:56:12,548 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:56:12,548 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:56:12" (2/3) ... [2018-11-23 12:56:12,549 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@132c728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:56:12, skipping insertion in model container [2018-11-23 12:56:12,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 12:56:12,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:12" (3/3) ... [2018-11-23 12:56:12,550 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c [2018-11-23 12:56:12,582 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:56:12,582 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 12:56:12,582 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 12:56:12,583 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 12:56:12,583 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:56:12,583 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:56:12,583 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 12:56:12,583 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:56:12,583 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 12:56:12,593 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-11-23 12:56:12,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 12:56:12,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:56:12,611 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:56:12,616 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:56:12,616 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:12,616 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 12:56:12,616 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 107 states. [2018-11-23 12:56:12,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 59 [2018-11-23 12:56:12,621 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:56:12,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:56:12,621 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-23 12:56:12,621 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:12,626 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 11#L-1true havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 7#L274true assume !(0 == ~r1~0);init_~tmp~0 := 0; 5#L274-1true init_#res := init_~tmp~0; 64#L435true main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 39#L513-2true [2018-11-23 12:56:12,627 INFO L796 eck$LassoCheckResult]: Loop: 39#L513-2true assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 19#L120true assume !(0 != ~mode1~0 % 256); 25#L136true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 23#L136-2true ~p1_new~0 := (if node1_#t~ite0 % 256 <= 127 then node1_#t~ite0 % 256 else node1_#t~ite0 % 256 - 256);havoc node1_#t~ite0;~mode1~0 := 1; 17#L120-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 93#L148true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 96#L151true assume !(node2_~m2~0 != ~nomsg~0); 95#L151-1true ~mode2~0 := 0; 92#L148-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 98#L173true assume !(0 != ~mode3~0 % 256); 3#L186true assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 20#L186-2true ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 94#L173-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 75#L198true assume !(0 != ~mode4~0 % 256); 103#L211true assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 102#L211-2true ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 88#L198-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 80#L223true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 68#L226true assume !(node5_~m5~0 != ~nomsg~0); 66#L226-1true ~mode5~0 := 0; 61#L223-2true havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 69#L248true assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 48#L251true assume !(node6_~m6~0 != ~nomsg~0); 47#L251-1true ~mode6~0 := 0; 65#L248-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 86#L443true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 87#L443-1true check_#res := check_~tmp~1; 56#L463true main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 37#L546true assume !(0 == assert_~arg % 256); 18#L541true main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 39#L513-2true [2018-11-23 12:56:12,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 28928112, now seen corresponding path program 1 times [2018-11-23 12:56:12,632 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:12,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:12,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:12,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:12,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:12,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:12,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:56:12,774 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 12:56:12,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:12,775 INFO L82 PathProgramCache]: Analyzing trace with hash -779821311, now seen corresponding path program 1 times [2018-11-23 12:56:12,775 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:12,775 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:12,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:12,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:12,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:12,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:12,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:12,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:12,857 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:56:12,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:56:12,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:56:12,868 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 4 states. [2018-11-23 12:56:12,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:12,937 INFO L93 Difference]: Finished difference Result 109 states and 183 transitions. [2018-11-23 12:56:12,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:56:12,939 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 183 transitions. [2018-11-23 12:56:12,940 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 12:56:12,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 102 states and 137 transitions. [2018-11-23 12:56:12,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-23 12:56:12,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-23 12:56:12,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 137 transitions. [2018-11-23 12:56:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:56:12,946 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 12:56:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 137 transitions. [2018-11-23 12:56:12,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 12:56:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:56:12,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 137 transitions. [2018-11-23 12:56:12,975 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 12:56:12,975 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 137 transitions. [2018-11-23 12:56:12,975 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 12:56:12,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 137 transitions. [2018-11-23 12:56:12,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 12:56:12,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:56:12,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:56:12,978 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:12,979 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:12,979 INFO L794 eck$LassoCheckResult]: Stem: 327#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 248#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 240#L274 assume 0 == ~r1~0; 241#L275 assume ~id1~0 >= 0; 289#L276 assume 0 == ~st1~0; 249#L277 assume ~send1~0 == ~id1~0; 250#L278 assume 0 == ~mode1~0 % 256; 294#L279 assume ~id2~0 >= 0; 295#L280 assume 0 == ~st2~0; 320#L281 assume ~send2~0 == ~id2~0; 265#L282 assume 0 == ~mode2~0 % 256; 266#L283 assume ~id3~0 >= 0; 304#L284 assume 0 == ~st3~0; 242#L285 assume ~send3~0 == ~id3~0; 243#L286 assume 0 == ~mode3~0 % 256; 307#L287 assume ~id4~0 >= 0; 251#L288 assume 0 == ~st4~0; 252#L289 assume ~send4~0 == ~id4~0; 297#L290 assume 0 == ~mode4~0 % 256; 298#L291 assume ~id5~0 >= 0; 321#L292 assume 0 == ~st5~0; 267#L293 assume ~send5~0 == ~id5~0; 268#L294 assume 0 == ~mode5~0 % 256; 305#L295 assume ~id6~0 >= 0; 246#L296 assume 0 == ~st6~0; 247#L297 assume ~send6~0 == ~id6~0; 308#L298 assume 0 == ~mode6~0 % 256; 255#L299 assume ~id1~0 != ~id2~0; 256#L300 assume ~id1~0 != ~id3~0; 299#L301 assume ~id1~0 != ~id4~0; 300#L302 assume ~id1~0 != ~id5~0; 312#L303 assume ~id1~0 != ~id6~0; 280#L304 assume ~id2~0 != ~id3~0; 281#L305 assume ~id2~0 != ~id4~0; 309#L306 assume ~id2~0 != ~id5~0; 253#L307 assume ~id2~0 != ~id6~0; 254#L308 assume ~id3~0 != ~id4~0; 306#L309 assume ~id3~0 != ~id5~0; 244#L310 assume ~id3~0 != ~id6~0; 245#L311 assume ~id4~0 != ~id5~0; 283#L312 assume ~id4~0 != ~id6~0; 284#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 235#L274-1 init_#res := init_~tmp~0; 236#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 260#L513-2 [2018-11-23 12:56:12,980 INFO L796 eck$LassoCheckResult]: Loop: 260#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 261#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 262#L124 assume !(node1_~m1~0 != ~nomsg~0); 271#L124-1 ~mode1~0 := 0; 257#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 258#L148 assume !(0 != ~mode2~0 % 256); 277#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 275#L161-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 276#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 329#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 322#L176 assume !(node3_~m3~0 != ~nomsg~0); 274#L176-1 ~mode3~0 := 0; 264#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 323#L198 assume !(0 != ~mode4~0 % 256); 324#L211 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 331#L211-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 315#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 325#L223 assume !(0 != ~mode5~0 % 256); 326#L236 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 332#L236-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 313#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 314#L248 assume !(0 != ~mode6~0 % 256); 319#L261 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 328#L261-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 302#L248-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 317#L443 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1 := 0; 291#L443-1 check_#res := check_~tmp~1; 311#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 288#L546 assume !(0 == assert_~arg % 256); 259#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 260#L513-2 [2018-11-23 12:56:12,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:12,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 1 times [2018-11-23 12:56:12,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:12,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:12,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:12,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1583129737, now seen corresponding path program 1 times [2018-11-23 12:56:13,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:13,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:13,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:13,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:13,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:56:13,139 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:56:13,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:13,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:13,140 INFO L87 Difference]: Start difference. First operand 102 states and 137 transitions. cyclomatic complexity: 36 Second operand 5 states. [2018-11-23 12:56:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:13,169 INFO L93 Difference]: Finished difference Result 105 states and 139 transitions. [2018-11-23 12:56:13,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:56:13,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 139 transitions. [2018-11-23 12:56:13,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 12:56:13,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 102 states and 134 transitions. [2018-11-23 12:56:13,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 102 [2018-11-23 12:56:13,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 102 [2018-11-23 12:56:13,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 134 transitions. [2018-11-23 12:56:13,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:56:13,174 INFO L705 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-11-23 12:56:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states and 134 transitions. [2018-11-23 12:56:13,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-11-23 12:56:13,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 12:56:13,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 134 transitions. [2018-11-23 12:56:13,178 INFO L728 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-11-23 12:56:13,178 INFO L608 BuchiCegarLoop]: Abstraction has 102 states and 134 transitions. [2018-11-23 12:56:13,178 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 12:56:13,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 134 transitions. [2018-11-23 12:56:13,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 58 [2018-11-23 12:56:13,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:56:13,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:56:13,181 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:13,181 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:13,181 INFO L794 eck$LassoCheckResult]: Stem: 546#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 467#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 459#L274 assume 0 == ~r1~0; 460#L275 assume ~id1~0 >= 0; 508#L276 assume 0 == ~st1~0; 468#L277 assume ~send1~0 == ~id1~0; 469#L278 assume 0 == ~mode1~0 % 256; 512#L279 assume ~id2~0 >= 0; 513#L280 assume 0 == ~st2~0; 539#L281 assume ~send2~0 == ~id2~0; 484#L282 assume 0 == ~mode2~0 % 256; 485#L283 assume ~id3~0 >= 0; 523#L284 assume 0 == ~st3~0; 461#L285 assume ~send3~0 == ~id3~0; 462#L286 assume 0 == ~mode3~0 % 256; 526#L287 assume ~id4~0 >= 0; 470#L288 assume 0 == ~st4~0; 471#L289 assume ~send4~0 == ~id4~0; 515#L290 assume 0 == ~mode4~0 % 256; 516#L291 assume ~id5~0 >= 0; 540#L292 assume 0 == ~st5~0; 486#L293 assume ~send5~0 == ~id5~0; 487#L294 assume 0 == ~mode5~0 % 256; 524#L295 assume ~id6~0 >= 0; 465#L296 assume 0 == ~st6~0; 466#L297 assume ~send6~0 == ~id6~0; 527#L298 assume 0 == ~mode6~0 % 256; 474#L299 assume ~id1~0 != ~id2~0; 475#L300 assume ~id1~0 != ~id3~0; 517#L301 assume ~id1~0 != ~id4~0; 518#L302 assume ~id1~0 != ~id5~0; 531#L303 assume ~id1~0 != ~id6~0; 499#L304 assume ~id2~0 != ~id3~0; 500#L305 assume ~id2~0 != ~id4~0; 528#L306 assume ~id2~0 != ~id5~0; 472#L307 assume ~id2~0 != ~id6~0; 473#L308 assume ~id3~0 != ~id4~0; 525#L309 assume ~id3~0 != ~id5~0; 463#L310 assume ~id3~0 != ~id6~0; 464#L311 assume ~id4~0 != ~id5~0; 502#L312 assume ~id4~0 != ~id6~0; 503#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 454#L274-1 init_#res := init_~tmp~0; 455#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 479#L513-2 [2018-11-23 12:56:13,181 INFO L796 eck$LassoCheckResult]: Loop: 479#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 480#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 481#L124 assume !(node1_~m1~0 != ~nomsg~0); 490#L124-1 ~mode1~0 := 0; 476#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 477#L148 assume !(0 != ~mode2~0 % 256); 496#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 494#L161-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 495#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 548#L173 assume !(0 != ~mode3~0 % 256); 450#L186 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 451#L186-2 ~p3_new~0 := (if node3_#t~ite2 % 256 <= 127 then node3_#t~ite2 % 256 else node3_#t~ite2 % 256 - 256);havoc node3_#t~ite2;~mode3~0 := 1; 483#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 542#L198 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 535#L201 assume !(node4_~m4~0 != ~nomsg~0); 498#L201-1 ~mode4~0 := 0; 534#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 544#L223 assume !(0 != ~mode5~0 % 256); 545#L236 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 551#L236-2 ~p5_new~0 := (if node5_#t~ite4 % 256 <= 127 then node5_#t~ite4 % 256 else node5_#t~ite4 % 256 - 256);havoc node5_#t~ite4;~mode5~0 := 1; 532#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 533#L248 assume !(0 != ~mode6~0 % 256); 538#L261 assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite5 := ~send6~0; 547#L261-2 ~p6_new~0 := (if node6_#t~ite5 % 256 <= 127 then node6_#t~ite5 % 256 else node6_#t~ite5 % 256 - 256);havoc node6_#t~ite5;~mode6~0 := 1; 521#L248-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 536#L443 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 514#L444 assume ~r1~0 >= 6; 510#L448 assume ~r1~0 < 6;check_~tmp~1 := 1; 520#L443-1 check_#res := check_~tmp~1; 530#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 507#L546 assume !(0 == assert_~arg % 256); 478#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 479#L513-2 [2018-11-23 12:56:13,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 2 times [2018-11-23 12:56:13,182 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:13,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,222 INFO L82 PathProgramCache]: Analyzing trace with hash 360303399, now seen corresponding path program 1 times [2018-11-23 12:56:13,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:13,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:13,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:13,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:13,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:56:13,253 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 12:56:13,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:56:13,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:56:13,254 INFO L87 Difference]: Start difference. First operand 102 states and 134 transitions. cyclomatic complexity: 33 Second operand 3 states. [2018-11-23 12:56:13,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:13,281 INFO L93 Difference]: Finished difference Result 154 states and 213 transitions. [2018-11-23 12:56:13,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:56:13,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 213 transitions. [2018-11-23 12:56:13,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2018-11-23 12:56:13,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 154 states and 213 transitions. [2018-11-23 12:56:13,285 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 154 [2018-11-23 12:56:13,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 154 [2018-11-23 12:56:13,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 154 states and 213 transitions. [2018-11-23 12:56:13,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:56:13,286 INFO L705 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-11-23 12:56:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 213 transitions. [2018-11-23 12:56:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-11-23 12:56:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 12:56:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2018-11-23 12:56:13,292 INFO L728 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-11-23 12:56:13,292 INFO L608 BuchiCegarLoop]: Abstraction has 154 states and 213 transitions. [2018-11-23 12:56:13,292 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 12:56:13,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 213 transitions. [2018-11-23 12:56:13,293 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 110 [2018-11-23 12:56:13,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 12:56:13,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 12:56:13,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:13,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:13,294 INFO L794 eck$LassoCheckResult]: Stem: 811#ULTIMATE.startENTRY ~r1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~mode1~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~mode2~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~mode3~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~mode4~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~mode5~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~mode6~0 := 0;~nomsg~0 := -1;~p1~0 := 0;~send1~0 := 0;~p2~0 := 0;~send2~0 := 0;~p3~0 := 0;~send3~0 := 0;~p4~0 := 0;~send4~0 := 0;~p5~0 := 0;~send5~0 := 0;~p6~0 := 0;~send6~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];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset]; 729#L-1 havoc main_#res;havoc main_#t~nondet6, main_#t~nondet7, main_#t~nondet8, main_#t~nondet9, 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~nondet23, main_#t~nondet24, main_#t~nondet25, main_#t~nondet26, main_#t~nondet27, main_#t~nondet28, main_#t~nondet29, main_#t~nondet30, main_#t~ret31, main_#t~ret32, main_#t~post33, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet6;havoc main_#t~nondet6;~id1~0 := main_#t~nondet7;havoc main_#t~nondet7;~st1~0 := main_#t~nondet8;havoc main_#t~nondet8;~send1~0 := main_#t~nondet9;havoc main_#t~nondet9;~mode1~0 := main_#t~nondet10;havoc main_#t~nondet10;~id2~0 := main_#t~nondet11;havoc main_#t~nondet11;~st2~0 := main_#t~nondet12;havoc main_#t~nondet12;~send2~0 := main_#t~nondet13;havoc main_#t~nondet13;~mode2~0 := main_#t~nondet14;havoc main_#t~nondet14;~id3~0 := main_#t~nondet15;havoc main_#t~nondet15;~st3~0 := main_#t~nondet16;havoc main_#t~nondet16;~send3~0 := main_#t~nondet17;havoc main_#t~nondet17;~mode3~0 := main_#t~nondet18;havoc main_#t~nondet18;~id4~0 := main_#t~nondet19;havoc main_#t~nondet19;~st4~0 := main_#t~nondet20;havoc main_#t~nondet20;~send4~0 := main_#t~nondet21;havoc main_#t~nondet21;~mode4~0 := main_#t~nondet22;havoc main_#t~nondet22;~id5~0 := main_#t~nondet23;havoc main_#t~nondet23;~st5~0 := main_#t~nondet24;havoc main_#t~nondet24;~send5~0 := main_#t~nondet25;havoc main_#t~nondet25;~mode5~0 := main_#t~nondet26;havoc main_#t~nondet26;~id6~0 := main_#t~nondet27;havoc main_#t~nondet27;~st6~0 := main_#t~nondet28;havoc main_#t~nondet28;~send6~0 := main_#t~nondet29;havoc main_#t~nondet29;~mode6~0 := main_#t~nondet30;havoc main_#t~nondet30;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 721#L274 assume 0 == ~r1~0; 722#L275 assume ~id1~0 >= 0; 770#L276 assume 0 == ~st1~0; 730#L277 assume ~send1~0 == ~id1~0; 731#L278 assume 0 == ~mode1~0 % 256; 775#L279 assume ~id2~0 >= 0; 776#L280 assume 0 == ~st2~0; 804#L281 assume ~send2~0 == ~id2~0; 746#L282 assume 0 == ~mode2~0 % 256; 747#L283 assume ~id3~0 >= 0; 787#L284 assume 0 == ~st3~0; 723#L285 assume ~send3~0 == ~id3~0; 724#L286 assume 0 == ~mode3~0 % 256; 790#L287 assume ~id4~0 >= 0; 732#L288 assume 0 == ~st4~0; 733#L289 assume ~send4~0 == ~id4~0; 779#L290 assume 0 == ~mode4~0 % 256; 780#L291 assume ~id5~0 >= 0; 805#L292 assume 0 == ~st5~0; 748#L293 assume ~send5~0 == ~id5~0; 749#L294 assume 0 == ~mode5~0 % 256; 788#L295 assume ~id6~0 >= 0; 727#L296 assume 0 == ~st6~0; 728#L297 assume ~send6~0 == ~id6~0; 791#L298 assume 0 == ~mode6~0 % 256; 736#L299 assume ~id1~0 != ~id2~0; 737#L300 assume ~id1~0 != ~id3~0; 781#L301 assume ~id1~0 != ~id4~0; 782#L302 assume ~id1~0 != ~id5~0; 795#L303 assume ~id1~0 != ~id6~0; 761#L304 assume ~id2~0 != ~id3~0; 762#L305 assume ~id2~0 != ~id4~0; 792#L306 assume ~id2~0 != ~id5~0; 734#L307 assume ~id2~0 != ~id6~0; 735#L308 assume ~id3~0 != ~id4~0; 789#L309 assume ~id3~0 != ~id5~0; 725#L310 assume ~id3~0 != ~id6~0; 726#L311 assume ~id4~0 != ~id5~0; 764#L312 assume ~id4~0 != ~id6~0; 765#L313 assume ~id5~0 != ~id6~0;init_~tmp~0 := 1; 716#L274-1 init_#res := init_~tmp~0; 717#L435 main_#t~ret31 := init_#res;main_~i2~0 := main_#t~ret31;havoc main_#t~ret31;assume 0 != main_~i2~0;~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;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0 := 0; 800#L513-2 [2018-11-23 12:56:13,294 INFO L796 eck$LassoCheckResult]: Loop: 800#L513-2 assume !!(main_~i2~0 < 12);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 742#L120 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0 := ~p6_old~0;~p6_old~0 := ~nomsg~0; 743#L124 assume !(node1_~m1~0 != ~nomsg~0); 752#L124-1 ~mode1~0 := 0; 738#L120-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 739#L148 assume !(0 != ~mode2~0 % 256); 758#L161 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 756#L161-2 ~p2_new~0 := (if node2_#t~ite1 % 256 <= 127 then node2_#t~ite1 % 256 else node2_#t~ite1 % 256 - 256);havoc node2_#t~ite1;~mode2~0 := 1; 757#L148-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 814#L173 assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 806#L176 assume !(node3_~m3~0 != ~nomsg~0); 755#L176-1 ~mode3~0 := 0; 745#L173-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 807#L198 assume !(0 != ~mode4~0 % 256); 808#L211 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 816#L211-2 ~p4_new~0 := (if node4_#t~ite3 % 256 <= 127 then node4_#t~ite3 % 256 else node4_#t~ite3 % 256 - 256);havoc node4_#t~ite3;~mode4~0 := 1; 798#L198-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 809#L223 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 802#L226 assume !(node5_~m5~0 != ~nomsg~0); 715#L226-1 ~mode5~0 := 0; 796#L223-2 havoc node6_#t~ite5, node6_~m6~0;havoc node6_~m6~0;node6_~m6~0 := ~nomsg~0; 797#L248 assume 0 != ~mode6~0 % 256;node6_~m6~0 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 786#L251 assume !(node6_~m6~0 != ~nomsg~0); 719#L251-1 ~mode6~0 := 0; 785#L248-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;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 801#L443 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; 812#L444 assume !(~r1~0 >= 6); 772#L447 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; 773#L448 assume ~r1~0 < 6;check_~tmp~1 := 1; 865#L443-1 check_#res := check_~tmp~1; 864#L463 main_#t~ret32 := check_#res;main_~c1~0 := main_#t~ret32;havoc main_#t~ret32;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 863#L546 assume !(0 == assert_~arg % 256); 862#L541 main_#t~post33 := main_~i2~0;main_~i2~0 := 1 + main_#t~post33;havoc main_#t~post33; 800#L513-2 [2018-11-23 12:56:13,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1620558881, now seen corresponding path program 3 times [2018-11-23 12:56:13,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:13,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash -482565050, now seen corresponding path program 1 times [2018-11-23 12:56:13,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,326 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:56:13,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 12:56:13,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:13,350 INFO L82 PathProgramCache]: Analyzing trace with hash 665183270, now seen corresponding path program 1 times [2018-11-23 12:56:13,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:13,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:13,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:13,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:13,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:56:13,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:56:13,838 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 173 DAG size of output: 168 [2018-11-23 12:56:15,722 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 164 DAG size of output: 153 [2018-11-23 12:56:15,733 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:56:15,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:56:15,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:56:15,735 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:56:15,735 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 12:56:15,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:56:15,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:56:15,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:56:15,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-11-23 12:56:15,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:56:15,736 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:56:15,752 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 12:56:15,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:15,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,022 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-23 12:56:16,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:16,275 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-23 12:56:16,386 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 12:56:20,551 WARN L180 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2018-11-23 12:56:20,636 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:56:20,636 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/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 [2018-11-23 12:56:20,640 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 12:56:20,640 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c995b3e9-9e48-442f-95ae-6e6cbe16172f/bin-2019/uautomizer/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 [2018-11-23 12:56:20,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 12:56:20,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 12:56:20,768 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 12:56:20,770 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 12:56:20,770 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 12:56:20,770 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 12:56:20,770 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 12:56:20,770 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 12:56:20,770 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 12:56:20,770 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 12:56:20,770 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 12:56:20,770 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_lcr.6_false-unreach-call.1.ufo.BOUNDED-12.pals_true-termination.c_Iteration4_Loop [2018-11-23 12:56:20,770 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 12:56:20,770 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 12:56:20,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-11-23 12:56:20,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,945 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 76 [2018-11-23 12:56:20,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:20,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 12:56:21,191 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-23 12:56:21,311 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 12:56:25,434 WARN L180 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 182 DAG size of output: 134 [2018-11-23 12:56:25,542 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 12:56:25,545 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 12:56:25,546 INFO L122 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 [2018-11-23 12:56:25,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,548 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-23 12:56:25,549 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,587 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-23 12:56:25,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,697 INFO L122 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 [2018-11-23 12:56:25,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,700 INFO L122 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 [2018-11-23 12:56:25,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,702 INFO L122 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 [2018-11-23 12:56:25,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:25,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:25,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,705 INFO L122 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 [2018-11-23 12:56:25,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,706 INFO L122 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 [2018-11-23 12:56:25,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,708 INFO L122 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 [2018-11-23 12:56:25,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,709 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 12:56:25,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,709 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 12:56:25,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,711 INFO L122 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 [2018-11-23 12:56:25,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:25,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:25,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,714 INFO L122 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 [2018-11-23 12:56:25,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,717 INFO L122 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 [2018-11-23 12:56:25,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:25,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:25,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,720 INFO L122 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 [2018-11-23 12:56:25,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:25,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:25,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,723 INFO L122 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 [2018-11-23 12:56:25,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,725 INFO L122 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 [2018-11-23 12:56:25,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,727 INFO L122 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 [2018-11-23 12:56:25,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 12:56:25,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 12:56:25,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 12:56:25,730 INFO L122 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 [2018-11-23 12:56:25,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 12:56:25,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 12:56:25,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 12:56:25,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 12:56:25,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 12:56:25,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 12:56:25,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 12:56:25,732 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 12:56:25,734 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 12:56:25,735 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 12:56:25,736 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 12:56:25,736 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-23 12:56:25,736 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 12:56:25,737 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 23 Supporting invariants [] [2018-11-23 12:56:25,738 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-23 12:56:25,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:25,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:25,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:25,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:25,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:25,833 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 [2018-11-23 12:56:25,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60 Second operand 3 states. [2018-11-23 12:56:25,877 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 213 transitions. cyclomatic complexity: 60. Second operand 3 states. Result 263 states and 382 transitions. Complement of second has 4 states. [2018-11-23 12:56:25,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-23 12:56:25,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:56:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2018-11-23 12:56:25,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 33 letters. [2018-11-23 12:56:25,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:25,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 77 letters. Loop has 33 letters. [2018-11-23 12:56:25,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:25,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 134 transitions. Stem has 44 letters. Loop has 66 letters. [2018-11-23 12:56:25,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 12:56:25,882 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 263 states and 382 transitions. [2018-11-23 12:56:25,885 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:56:25,886 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 263 states to 0 states and 0 transitions. [2018-11-23 12:56:25,886 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:56:25,886 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:56:25,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:56:25,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:56:25,886 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:25,886 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:25,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:56:25,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:56:25,886 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2018-11-23 12:56:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:25,887 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:56:25,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:56:25,887 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 12:56:25,887 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 12:56:25,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 12:56:25,887 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 12:56:25,887 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 12:56:25,887 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 12:56:25,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 12:56:25,891 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:56:25 BoogieIcfgContainer [2018-11-23 12:56:25,891 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 12:56:25,892 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 12:56:25,892 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 12:56:25,892 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 12:56:25,892 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:56:12" (3/4) ... [2018-11-23 12:56:25,895 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 12:56:25,895 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 12:56:25,896 INFO L168 Benchmark]: Toolchain (without parser) took 14164.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 491.8 MB). Free memory was 961.8 MB in the beginning and 934.3 MB in the end (delta: 27.5 MB). Peak memory consumption was 519.2 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,896 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:25,897 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,897 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,898 INFO L168 Benchmark]: Boogie Preprocessor took 23.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:25,898 INFO L168 Benchmark]: RCFGBuilder took 458.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,898 INFO L168 Benchmark]: BuchiAutomizer took 13347.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.1 GB in the beginning and 934.3 MB in the end (delta: 167.5 MB). Peak memory consumption was 490.4 MB. Max. memory is 11.5 GB. [2018-11-23 12:56:25,899 INFO L168 Benchmark]: Witness Printer took 3.48 ms. Allocated memory is still 1.5 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 12:56:25,902 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 982.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 295.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -200.2 MB). Peak memory consumption was 31.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.33 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 458.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 51.6 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13347.00 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.0 MB). Free memory was 1.1 GB in the beginning and 934.3 MB in the end (delta: 167.5 MB). Peak memory consumption was 490.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.48 ms. Allocated memory is still 1.5 GB. Free memory is still 934.3 MB. There was no memory consumed. Max. memory is 11.5 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 + 23 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 12.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 154 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 653 SDtfs, 213 SDslu, 929 SDs, 0 SdLazy, 32 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1562 mio100 ax104 hnf100 lsp10 ukn72 mio100 lsp100 div153 bol100 ite100 ukn100 eq177 hnf71 smp100 dnf5369 smp24 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 150ms VariablesStem: 0 VariablesLoop: 35 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...