./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/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 6191f76ca1968cb0b63f42b60887059af617e3ab .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:52:25,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:52:25,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:52:25,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:52:25,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:52:25,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:52:25,222 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:52:25,224 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:52:25,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:52:25,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:52:25,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:52:25,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:52:25,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:52:25,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:52:25,228 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:52:25,229 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:52:25,230 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:52:25,231 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:52:25,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:52:25,233 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:52:25,234 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:52:25,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:52:25,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:52:25,236 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:52:25,238 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:52:25,238 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:52:25,238 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:52:25,239 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:52:25,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:52:25,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:52:25,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:52:25,240 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:52:25,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:52:25,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:52:25,241 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:52:25,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:52:25,242 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:52:25,242 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:52:25,242 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:52:25,243 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:52:25,243 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:52:25,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-12-07 18:52:25,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:52:25,254 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:52:25,254 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:52:25,255 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * Use old map elimination=false [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-12-07 18:52:25,255 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-12-07 18:52:25,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-12-07 18:52:25,256 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-12-07 18:52:25,257 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:52:25,257 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-12-07 18:52:25,258 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:52:25,258 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:52:25,258 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:52:25,258 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-12-07 18:52:25,259 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-12-07 18:52:25,259 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/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 -> 6191f76ca1968cb0b63f42b60887059af617e3ab [2019-12-07 18:52:25,359 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:52:25,366 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:52:25,368 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:52:25,369 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:52:25,370 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:52:25,370 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2019-12-07 18:52:25,407 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/data/e8387e071/4dd34ab271e1432abab2cdc38256a81b/FLAGd392960ad [2019-12-07 18:52:25,783 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:52:25,784 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2019-12-07 18:52:25,790 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/data/e8387e071/4dd34ab271e1432abab2cdc38256a81b/FLAGd392960ad [2019-12-07 18:52:26,168 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/data/e8387e071/4dd34ab271e1432abab2cdc38256a81b [2019-12-07 18:52:26,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:52:26,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:52:26,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:26,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:52:26,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:52:26,182 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50c8692a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26, skipping insertion in model container [2019-12-07 18:52:26,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:52:26,211 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:52:26,381 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:26,386 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:52:26,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:52:26,428 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:52:26,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26 WrapperNode [2019-12-07 18:52:26,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:52:26,429 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:52:26,429 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:52:26,429 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:52:26,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,442 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:52:26,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:52:26,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:52:26,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:52:26,468 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,468 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,475 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,482 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... [2019-12-07 18:52:26,484 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:52:26,485 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:52:26,485 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:52:26,485 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:52:26,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/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 [2019-12-07 18:52:26,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:52:26,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:52:26,831 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:52:26,832 INFO L287 CfgBuilder]: Removed 21 assume(true) statements. [2019-12-07 18:52:26,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:26 BoogieIcfgContainer [2019-12-07 18:52:26,833 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:52:26,833 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-12-07 18:52:26,833 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-12-07 18:52:26,836 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-12-07 18:52:26,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:52:26,836 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 07.12 06:52:26" (1/3) ... [2019-12-07 18:52:26,837 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71abd66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:52:26, skipping insertion in model container [2019-12-07 18:52:26,837 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:52:26,837 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:52:26" (2/3) ... [2019-12-07 18:52:26,838 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71abd66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 07.12 06:52:26, skipping insertion in model container [2019-12-07 18:52:26,838 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-12-07 18:52:26,838 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:26" (3/3) ... [2019-12-07 18:52:26,839 INFO L371 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2019-12-07 18:52:26,867 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-12-07 18:52:26,868 INFO L357 BuchiCegarLoop]: Hoare is false [2019-12-07 18:52:26,868 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-12-07 18:52:26,868 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:52:26,868 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:52:26,868 INFO L361 BuchiCegarLoop]: Difference is false [2019-12-07 18:52:26,868 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:52:26,868 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-12-07 18:52:26,882 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2019-12-07 18:52:26,903 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-12-07 18:52:26,903 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:52:26,903 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:52:26,910 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 18:52:26,911 INFO L850 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] [2019-12-07 18:52:26,911 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-12-07 18:52:26,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states. [2019-12-07 18:52:26,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-12-07 18:52:26,915 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:52:26,916 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:52:26,916 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-12-07 18:52:26,916 INFO L850 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] [2019-12-07 18:52:26,922 INFO L794 eck$LassoCheckResult]: Stem: 44#ULTIMATE.startENTRYtrue ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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]; 14#L-1true havoc main_#res;havoc main_#t~nondet5, 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~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 32#L242true assume !(0 == ~r1~0);init_~tmp~0 := 0; 30#L242-1true init_#res := init_~tmp~0; 76#L367true main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;main_~i2~0 := 0; 39#L439-2true [2019-12-07 18:52:26,922 INFO L796 eck$LassoCheckResult]: Loop: 39#L439-2true assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 7#L113true assume !(0 != ~mode1~0 % 256); 71#L129true assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 67#L129-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; 3#L113-2true havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 89#L141true assume 0 != ~mode2~0 % 256;node2_~m2~0 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 59#L144true assume !(node2_~m2~0 != ~nomsg~0); 55#L144-1true ~mode2~0 := 0; 86#L141-2true havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 61#L166true assume 0 != ~mode3~0 % 256;node3_~m3~0 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 40#L169true assume !(node3_~m3~0 != ~nomsg~0); 35#L169-1true ~mode3~0 := 0; 77#L166-2true havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 68#L191true assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 49#L194true assume !(node4_~m4~0 != ~nomsg~0); 48#L194-1true ~mode4~0 := 0; 34#L191-2true havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 51#L216true assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 5#L219true assume !(node5_~m5~0 != ~nomsg~0); 4#L219-1true ~mode5~0 := 0; 47#L216-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 82#L375true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 83#L375-1true check_#res := check_~tmp~1; 37#L395true main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 64#L469true assume !(0 == assert_~arg % 256); 25#L464true main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 39#L439-2true [2019-12-07 18:52:26,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:26,926 INFO L82 PathProgramCache]: Analyzing trace with hash 28874490, now seen corresponding path program 1 times [2019-12-07 18:52:26,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:26,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924099027] [2019-12-07 18:52:26,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924099027] [2019-12-07 18:52:27,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:27,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700968315] [2019-12-07 18:52:27,060 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-12-07 18:52:27,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2097075120, now seen corresponding path program 1 times [2019-12-07 18:52:27,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647902799] [2019-12-07 18:52:27,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647902799] [2019-12-07 18:52:27,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:27,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515478945] [2019-12-07 18:52:27,146 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:52:27,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:27,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:52:27,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:52:27,158 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 4 states. [2019-12-07 18:52:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:27,221 INFO L93 Difference]: Finished difference Result 92 states and 152 transitions. [2019-12-07 18:52:27,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:52:27,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 152 transitions. [2019-12-07 18:52:27,227 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-12-07 18:52:27,232 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 85 states and 115 transitions. [2019-12-07 18:52:27,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-12-07 18:52:27,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-12-07 18:52:27,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 115 transitions. [2019-12-07 18:52:27,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:52:27,235 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2019-12-07 18:52:27,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 115 transitions. [2019-12-07 18:52:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-07 18:52:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 18:52:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 115 transitions. [2019-12-07 18:52:27,258 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2019-12-07 18:52:27,258 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 115 transitions. [2019-12-07 18:52:27,258 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-12-07 18:52:27,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 115 transitions. [2019-12-07 18:52:27,260 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-12-07 18:52:27,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:52:27,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:52:27,262 INFO L849 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] [2019-12-07 18:52:27,262 INFO L850 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] [2019-12-07 18:52:27,263 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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]; 217#L-1 havoc main_#res;havoc main_#t~nondet5, 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~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 218#L242 assume 0 == ~r1~0; 244#L243 assume ~id1~0 >= 0; 273#L244 assume 0 == ~st1~0; 254#L245 assume ~send1~0 == ~id1~0; 255#L246 assume 0 == ~mode1~0 % 256; 277#L247 assume ~id2~0 >= 0; 228#L248 assume 0 == ~st2~0; 229#L249 assume ~send2~0 == ~id2~0; 265#L250 assume 0 == ~mode2~0 % 256; 268#L251 assume ~id3~0 >= 0; 211#L252 assume 0 == ~st3~0; 212#L253 assume ~send3~0 == ~id3~0; 246#L254 assume 0 == ~mode3~0 % 256; 219#L255 assume ~id4~0 >= 0; 220#L256 assume 0 == ~st4~0; 257#L257 assume ~send4~0 == ~id4~0; 278#L258 assume 0 == ~mode4~0 % 256; 232#L259 assume ~id5~0 >= 0; 233#L260 assume 0 == ~st5~0; 266#L261 assume ~send5~0 == ~id5~0; 269#L262 assume 0 == ~mode5~0 % 256; 213#L263 assume ~id1~0 != ~id2~0; 214#L264 assume ~id1~0 != ~id3~0; 247#L265 assume ~id1~0 != ~id4~0; 221#L266 assume ~id1~0 != ~id5~0; 222#L267 assume ~id2~0 != ~id3~0; 258#L268 assume ~id2~0 != ~id4~0; 279#L269 assume ~id2~0 != ~id5~0; 234#L270 assume ~id3~0 != ~id4~0; 235#L271 assume ~id3~0 != ~id5~0; 236#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 241#L242-1 init_#res := init_~tmp~0; 242#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;main_~i2~0 := 0; 231#L439-2 [2019-12-07 18:52:27,263 INFO L796 eck$LassoCheckResult]: Loop: 231#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 206#L113 assume !(0 != ~mode1~0 % 256); 208#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 275#L129-2 ~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; 197#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 198#L141 assume !(0 != ~mode2~0 % 256); 237#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 238#L154-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; 262#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 272#L166 assume !(0 != ~mode3~0 % 256); 215#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 209#L179-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; 210#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 276#L191 assume !(0 != ~mode4~0 % 256); 225#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 223#L204-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; 224#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 245#L216 assume !(0 != ~mode5~0 % 256); 263#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 281#L229-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; 200#L216-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 259#L375 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1 := 0; 226#L375-1 check_#res := check_~tmp~1; 249#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 250#L469 assume !(0 == assert_~arg % 256); 230#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 231#L439-2 [2019-12-07 18:52:27,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,263 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 1 times [2019-12-07 18:52:27,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853632450] [2019-12-07 18:52:27,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,332 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:52:27,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,333 INFO L82 PathProgramCache]: Analyzing trace with hash 219355176, now seen corresponding path program 1 times [2019-12-07 18:52:27,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066860124] [2019-12-07 18:52:27,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066860124] [2019-12-07 18:52:27,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:52:27,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012857638] [2019-12-07 18:52:27,394 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:52:27,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:52:27,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:52:27,395 INFO L87 Difference]: Start difference. First operand 85 states and 115 transitions. cyclomatic complexity: 31 Second operand 5 states. [2019-12-07 18:52:27,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:27,429 INFO L93 Difference]: Finished difference Result 88 states and 117 transitions. [2019-12-07 18:52:27,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:52:27,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 117 transitions. [2019-12-07 18:52:27,431 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-12-07 18:52:27,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 85 states and 112 transitions. [2019-12-07 18:52:27,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2019-12-07 18:52:27,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2019-12-07 18:52:27,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 85 states and 112 transitions. [2019-12-07 18:52:27,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:52:27,433 INFO L688 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-12-07 18:52:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states and 112 transitions. [2019-12-07 18:52:27,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-12-07 18:52:27,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-12-07 18:52:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2019-12-07 18:52:27,437 INFO L711 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-12-07 18:52:27,437 INFO L591 BuchiCegarLoop]: Abstraction has 85 states and 112 transitions. [2019-12-07 18:52:27,437 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-12-07 18:52:27,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 85 states and 112 transitions. [2019-12-07 18:52:27,438 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2019-12-07 18:52:27,438 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:52:27,438 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:52:27,439 INFO L849 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] [2019-12-07 18:52:27,439 INFO L850 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] [2019-12-07 18:52:27,439 INFO L794 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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]; 402#L-1 havoc main_#res;havoc main_#t~nondet5, 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~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 403#L242 assume 0 == ~r1~0; 429#L243 assume ~id1~0 >= 0; 458#L244 assume 0 == ~st1~0; 438#L245 assume ~send1~0 == ~id1~0; 439#L246 assume 0 == ~mode1~0 % 256; 462#L247 assume ~id2~0 >= 0; 413#L248 assume 0 == ~st2~0; 414#L249 assume ~send2~0 == ~id2~0; 449#L250 assume 0 == ~mode2~0 % 256; 453#L251 assume ~id3~0 >= 0; 396#L252 assume 0 == ~st3~0; 397#L253 assume ~send3~0 == ~id3~0; 430#L254 assume 0 == ~mode3~0 % 256; 404#L255 assume ~id4~0 >= 0; 405#L256 assume 0 == ~st4~0; 442#L257 assume ~send4~0 == ~id4~0; 463#L258 assume 0 == ~mode4~0 % 256; 415#L259 assume ~id5~0 >= 0; 416#L260 assume 0 == ~st5~0; 451#L261 assume ~send5~0 == ~id5~0; 454#L262 assume 0 == ~mode5~0 % 256; 398#L263 assume ~id1~0 != ~id2~0; 399#L264 assume ~id1~0 != ~id3~0; 432#L265 assume ~id1~0 != ~id4~0; 406#L266 assume ~id1~0 != ~id5~0; 407#L267 assume ~id2~0 != ~id3~0; 443#L268 assume ~id2~0 != ~id4~0; 464#L269 assume ~id2~0 != ~id5~0; 419#L270 assume ~id3~0 != ~id4~0; 420#L271 assume ~id3~0 != ~id5~0; 421#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 426#L242-1 init_#res := init_~tmp~0; 427#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;main_~i2~0 := 0; 418#L439-2 [2019-12-07 18:52:27,439 INFO L796 eck$LassoCheckResult]: Loop: 418#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 391#L113 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 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 392#L117 assume !(node1_~m1~0 != ~nomsg~0); 401#L117-1 ~mode1~0 := 0; 382#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 383#L141 assume !(0 != ~mode2~0 % 256); 422#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 423#L154-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; 447#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 457#L166 assume !(0 != ~mode3~0 % 256); 400#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 394#L179-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; 395#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 461#L191 assume !(0 != ~mode4~0 % 256); 410#L204 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite3 := ~send4~0; 408#L204-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; 409#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 431#L216 assume !(0 != ~mode5~0 % 256); 448#L229 assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite4 := ~send5~0; 466#L229-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; 385#L216-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 444#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 388#L376 assume ~r1~0 >= 5; 389#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 411#L375-1 check_#res := check_~tmp~1; 434#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 435#L469 assume !(0 == assert_~arg % 256); 417#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 418#L439-2 [2019-12-07 18:52:27,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,440 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 2 times [2019-12-07 18:52:27,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125807378] [2019-12-07 18:52:27,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,473 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:52:27,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1823427134, now seen corresponding path program 1 times [2019-12-07 18:52:27,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500063217] [2019-12-07 18:52:27,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500063217] [2019-12-07 18:52:27,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:27,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280013139] [2019-12-07 18:52:27,494 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-12-07 18:52:27,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:52:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:52:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:52:27,495 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. cyclomatic complexity: 28 Second operand 3 states. [2019-12-07 18:52:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:52:27,514 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2019-12-07 18:52:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:52:27,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 178 transitions. [2019-12-07 18:52:27,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2019-12-07 18:52:27,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 129 states and 178 transitions. [2019-12-07 18:52:27,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 129 [2019-12-07 18:52:27,517 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 129 [2019-12-07 18:52:27,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 178 transitions. [2019-12-07 18:52:27,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:52:27,518 INFO L688 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2019-12-07 18:52:27,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 178 transitions. [2019-12-07 18:52:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-12-07 18:52:27,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 18:52:27,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2019-12-07 18:52:27,523 INFO L711 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2019-12-07 18:52:27,523 INFO L591 BuchiCegarLoop]: Abstraction has 129 states and 178 transitions. [2019-12-07 18:52:27,523 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-12-07 18:52:27,523 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 129 states and 178 transitions. [2019-12-07 18:52:27,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2019-12-07 18:52:27,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-12-07 18:52:27,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-12-07 18:52:27,525 INFO L849 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] [2019-12-07 18:52:27,525 INFO L850 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] [2019-12-07 18:52:27,525 INFO L794 eck$LassoCheckResult]: Stem: 661#ULTIMATE.startENTRY ~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~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]; 622#L-1 havoc main_#res;havoc main_#t~nondet5, 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~ret26, main_#t~ret27, main_#t~post28, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~r1~0 := main_#t~nondet5;havoc main_#t~nondet5;~id1~0 := main_#t~nondet6;havoc main_#t~nondet6;~st1~0 := main_#t~nondet7;havoc main_#t~nondet7;~send1~0 := main_#t~nondet8;havoc main_#t~nondet8;~mode1~0 := main_#t~nondet9;havoc main_#t~nondet9;~id2~0 := main_#t~nondet10;havoc main_#t~nondet10;~st2~0 := main_#t~nondet11;havoc main_#t~nondet11;~send2~0 := main_#t~nondet12;havoc main_#t~nondet12;~mode2~0 := main_#t~nondet13;havoc main_#t~nondet13;~id3~0 := main_#t~nondet14;havoc main_#t~nondet14;~st3~0 := main_#t~nondet15;havoc main_#t~nondet15;~send3~0 := main_#t~nondet16;havoc main_#t~nondet16;~mode3~0 := main_#t~nondet17;havoc main_#t~nondet17;~id4~0 := main_#t~nondet18;havoc main_#t~nondet18;~st4~0 := main_#t~nondet19;havoc main_#t~nondet19;~send4~0 := main_#t~nondet20;havoc main_#t~nondet20;~mode4~0 := main_#t~nondet21;havoc main_#t~nondet21;~id5~0 := main_#t~nondet22;havoc main_#t~nondet22;~st5~0 := main_#t~nondet23;havoc main_#t~nondet23;~send5~0 := main_#t~nondet24;havoc main_#t~nondet24;~mode5~0 := main_#t~nondet25;havoc main_#t~nondet25;havoc init_#res;havoc init_~tmp~0;havoc init_~tmp~0; 623#L242 assume 0 == ~r1~0; 648#L243 assume ~id1~0 >= 0; 679#L244 assume 0 == ~st1~0; 658#L245 assume ~send1~0 == ~id1~0; 659#L246 assume 0 == ~mode1~0 % 256; 683#L247 assume ~id2~0 >= 0; 632#L248 assume 0 == ~st2~0; 633#L249 assume ~send2~0 == ~id2~0; 670#L250 assume 0 == ~mode2~0 % 256; 673#L251 assume ~id3~0 >= 0; 615#L252 assume 0 == ~st3~0; 616#L253 assume ~send3~0 == ~id3~0; 650#L254 assume 0 == ~mode3~0 % 256; 624#L255 assume ~id4~0 >= 0; 625#L256 assume 0 == ~st4~0; 662#L257 assume ~send4~0 == ~id4~0; 684#L258 assume 0 == ~mode4~0 % 256; 636#L259 assume ~id5~0 >= 0; 637#L260 assume 0 == ~st5~0; 671#L261 assume ~send5~0 == ~id5~0; 674#L262 assume 0 == ~mode5~0 % 256; 617#L263 assume ~id1~0 != ~id2~0; 618#L264 assume ~id1~0 != ~id3~0; 654#L265 assume ~id1~0 != ~id4~0; 628#L266 assume ~id1~0 != ~id5~0; 629#L267 assume ~id2~0 != ~id3~0; 663#L268 assume ~id2~0 != ~id4~0; 685#L269 assume ~id2~0 != ~id5~0; 638#L270 assume ~id3~0 != ~id4~0; 639#L271 assume ~id3~0 != ~id5~0; 640#L272 assume ~id4~0 != ~id5~0;init_~tmp~0 := 1; 645#L242-1 init_#res := init_~tmp~0; 646#L367 main_#t~ret26 := init_#res;main_~i2~0 := main_#t~ret26;havoc main_#t~ret26;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;main_~i2~0 := 0; 687#L439-2 [2019-12-07 18:52:27,525 INFO L796 eck$LassoCheckResult]: Loop: 687#L439-2 assume !!(main_~i2~0 < 10);havoc node1_#t~ite0, node1_~m1~0;havoc node1_~m1~0;node1_~m1~0 := ~nomsg~0; 724#L113 assume !(0 != ~mode1~0 % 256); 723#L129 assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite0 := ~send1~0; 722#L129-2 ~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; 621#L113-2 havoc node2_#t~ite1, node2_~m2~0;havoc node2_~m2~0;node2_~m2~0 := ~nomsg~0; 721#L141 assume !(0 != ~mode2~0 % 256); 720#L154 assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite1 := ~send2~0; 719#L154-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; 718#L141-2 havoc node3_#t~ite2, node3_~m3~0;havoc node3_~m3~0;node3_~m3~0 := ~nomsg~0; 717#L166 assume !(0 != ~mode3~0 % 256); 713#L179 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite2 := ~send3~0; 711#L179-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; 710#L166-2 havoc node4_#t~ite3, node4_~m4~0;havoc node4_~m4~0;node4_~m4~0 := ~nomsg~0; 709#L191 assume 0 != ~mode4~0 % 256;node4_~m4~0 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 707#L194 assume !(node4_~m4~0 != ~nomsg~0); 703#L194-1 ~mode4~0 := 0; 702#L191-2 havoc node5_#t~ite4, node5_~m5~0;havoc node5_~m5~0;node5_~m5~0 := ~nomsg~0; 701#L216 assume 0 != ~mode5~0 % 256;node5_~m5~0 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 699#L219 assume !(node5_~m5~0 != ~nomsg~0); 695#L219-1 ~mode5~0 := 0; 694#L216-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;havoc check_#res;havoc check_~tmp~1;havoc check_~tmp~1; 693#L375 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 692#L376 assume !(~r1~0 >= 5); 690#L379 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 691#L380 assume ~r1~0 < 5;check_~tmp~1 := 1; 730#L375-1 check_#res := check_~tmp~1; 729#L395 main_#t~ret27 := check_#res;main_~c1~0 := main_#t~ret27;havoc main_#t~ret27;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 728#L469 assume !(0 == assert_~arg % 256); 727#L464 main_#t~post28 := main_~i2~0;main_~i2~0 := 1 + main_#t~post28;havoc main_#t~post28; 687#L439-2 [2019-12-07 18:52:27,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,526 INFO L82 PathProgramCache]: Analyzing trace with hash -806541263, now seen corresponding path program 3 times [2019-12-07 18:52:27,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185138072] [2019-12-07 18:52:27,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:52:27,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1664257150, now seen corresponding path program 1 times [2019-12-07 18:52:27,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247708819] [2019-12-07 18:52:27,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:52:27,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:52:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:52:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash -241790386, now seen corresponding path program 1 times [2019-12-07 18:52:27,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:52:27,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797294028] [2019-12-07 18:52:27,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:52:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:52:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:52:27,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797294028] [2019-12-07 18:52:27,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:52:27,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:52:27,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174728935] [2019-12-07 18:52:27,948 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2019-12-07 18:52:29,791 WARN L192 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 145 DAG size of output: 134 [2019-12-07 18:52:29,801 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:52:29,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:52:29,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:52:29,801 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:52:29,802 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2019-12-07 18:52:29,802 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:52:29,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:52:29,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:52:29,802 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2019-12-07 18:52:29,802 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:52:29,802 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:52:29,816 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 18:52:29,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:29,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,043 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-12-07 18:52:30,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:52:30,303 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-12-07 18:52:30,373 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 18:53:04,160 WARN L192 SmtUtils]: Spent 33.66 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2019-12-07 18:53:04,256 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:53:04,257 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/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 [2019-12-07 18:53:04,261 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-12-07 18:53:04,261 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/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 [2019-12-07 18:53:04,269 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-12-07 18:53:04,269 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-12-07 18:53:04,385 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-12-07 18:53:04,387 INFO L210 LassoAnalysis]: Preferences: [2019-12-07 18:53:04,387 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-12-07 18:53:04,387 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-12-07 18:53:04,387 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-12-07 18:53:04,387 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-12-07 18:53:04,387 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:04,387 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-12-07 18:53:04,388 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-12-07 18:53:04,388 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2019-12-07 18:53:04,388 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-12-07 18:53:04,388 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-12-07 18:53:04,390 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-12-07 18:53:04,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,585 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2019-12-07 18:53:04,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-12-07 18:53:04,860 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-12-07 18:53:04,922 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2019-12-07 18:53:38,016 WARN L192 SmtUtils]: Spent 32.99 s on a formula simplification. DAG size of input: 634 DAG size of output: 186 [2019-12-07 18:53:38,081 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-12-07 18:53:38,086 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,095 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:38,095 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:38,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,107 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,109 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:53:38,109 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:53:38,111 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,116 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,117 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:38,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:38,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,128 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,128 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,128 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,128 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,128 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,128 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:38,128 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:38,129 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,137 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:53:38,137 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:53:38,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,145 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,145 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,145 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,145 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,145 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,146 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:38,146 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:38,149 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,153 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:53:38,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:53:38,158 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,163 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,164 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,164 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,165 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,165 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,166 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:38,166 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:38,168 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,175 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,176 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:38,176 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:38,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,183 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:38,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,184 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:53:38,184 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:53:38,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:38,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:38,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:38,193 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:38,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:38,194 INFO L204 nArgumentSynthesizer]: 64 loop disjuncts [2019-12-07 18:53:38,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:38,590 INFO L401 nArgumentSynthesizer]: We have 128 Motzkin's Theorem applications. [2019-12-07 18:53:38,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:39,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:39,216 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:39,217 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:39,217 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:39,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:39,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:39,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:39,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:39,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:39,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:39,223 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:39,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:39,224 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:39,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:39,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:39,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:39,225 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:39,225 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:39,226 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:39,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:39,230 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:39,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:39,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:39,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:39,232 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-12-07 18:53:39,232 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-12-07 18:53:39,234 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:39,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:39,242 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:39,242 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:39,242 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:39,242 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:39,242 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:39,243 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:39,243 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:39,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:39,250 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-12-07 18:53:39,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-12-07 18:53:39,251 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-12-07 18:53:39,251 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-12-07 18:53:39,251 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-12-07 18:53:39,251 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-12-07 18:53:39,252 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-12-07 18:53:39,252 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-12-07 18:53:39,253 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-12-07 18:53:39,258 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-12-07 18:53:39,258 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_92e72213-4825-4263-bbdf-c1704557f86f/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-12-07 18:53:39,261 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-12-07 18:53:39,261 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-12-07 18:53:39,261 INFO L510 LassoAnalysis]: Proved termination. [2019-12-07 18:53:39,262 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 19 Supporting invariants [] [2019-12-07 18:53:39,265 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-12-07 18:53:39,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:53:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:39,312 INFO L264 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:53:39,314 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:53:39,340 INFO L264 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:53:39,341 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:53:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:53:39,360 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 [2019-12-07 18:53:39,361 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50 Second operand 3 states. [2019-12-07 18:53:39,404 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 129 states and 178 transitions. cyclomatic complexity: 50. Second operand 3 states. Result 222 states and 321 transitions. Complement of second has 4 states. [2019-12-07 18:53:39,404 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 [2019-12-07 18:53:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-12-07 18:53:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2019-12-07 18:53:39,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 29 letters. [2019-12-07 18:53:39,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:53:39,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 64 letters. Loop has 29 letters. [2019-12-07 18:53:39,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:53:39,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 112 transitions. Stem has 35 letters. Loop has 58 letters. [2019-12-07 18:53:39,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-12-07 18:53:39,410 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 321 transitions. [2019-12-07 18:53:39,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:53:39,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 0 states and 0 transitions. [2019-12-07 18:53:39,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 18:53:39,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 18:53:39,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 18:53:39,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:53:39,413 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:53:39,413 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:53:39,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:53:39,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:53:39,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:53:39,414 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 3 states. [2019-12-07 18:53:39,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:53:39,414 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-12-07 18:53:39,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 18:53:39,414 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-12-07 18:53:39,414 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:53:39,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:53:39,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-12-07 18:53:39,415 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-12-07 18:53:39,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-12-07 18:53:39,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-12-07 18:53:39,415 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:53:39,415 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:53:39,415 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:53:39,415 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-12-07 18:53:39,415 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:53:39,415 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-12-07 18:53:39,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-12-07 18:53:39,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 07.12 06:53:39 BoogieIcfgContainer [2019-12-07 18:53:39,421 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-12-07 18:53:39,421 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:53:39,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:53:39,421 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:53:39,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:52:26" (3/4) ... [2019-12-07 18:53:39,425 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:53:39,425 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:53:39,426 INFO L168 Benchmark]: Toolchain (without parser) took 73251.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 944.7 MB in the beginning and 964.2 MB in the end (delta: -19.5 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,426 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,427 INFO L168 Benchmark]: CACSL2BoogieTranslator took 252.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -117.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,427 INFO L168 Benchmark]: Boogie Preprocessor took 22.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,428 INFO L168 Benchmark]: RCFGBuilder took 348.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,428 INFO L168 Benchmark]: BuchiAutomizer took 72587.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 964.2 MB in the end (delta: 53.2 MB). Peak memory consumption was 158.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:53:39,429 INFO L168 Benchmark]: Witness Printer took 3.50 ms. Allocated memory is still 1.2 GB. Free memory is still 964.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:53:39,431 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 252.17 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 74.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -117.9 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.40 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 348.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 72587.70 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 104.9 MB). Free memory was 1.0 GB in the beginning and 964.2 MB in the end (delta: 53.2 MB). Peak memory consumption was 158.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.50 ms. Allocated memory is still 1.2 GB. Free memory is still 964.2 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 + 19 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 72.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 72.1s. 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 129 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 543 SDtfs, 178 SDslu, 775 SDs, 0 SdLazy, 32 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital1394 mio100 ax104 hnf100 lsp14 ukn65 mio100 lsp100 div167 bol100 ite100 ukn100 eq168 hnf68 smp100 dnf40036 smp11 tf100 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 1016ms VariablesStem: 0 VariablesLoop: 32 DisjunctsStem: 1 DisjunctsLoop: 64 SupportingInvariants: 0 MotzkinApplications: 128 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...