./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0942677612f90fad3f45a67c18b7387cde689b6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 08:08:10,953 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 08:08:10,954 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 08:08:10,961 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 08:08:10,961 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 08:08:10,962 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 08:08:10,963 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 08:08:10,965 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 08:08:10,966 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 08:08:10,966 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 08:08:10,967 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 08:08:10,967 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 08:08:10,968 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 08:08:10,969 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 08:08:10,970 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 08:08:10,970 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 08:08:10,971 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 08:08:10,972 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 08:08:10,974 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 08:08:10,975 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 08:08:10,976 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 08:08:10,977 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 08:08:10,979 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 08:08:10,979 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 08:08:10,979 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 08:08:10,980 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 08:08:10,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 08:08:10,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 08:08:10,982 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 08:08:10,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 08:08:10,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 08:08:10,983 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 08:08:10,983 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 08:08:10,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 08:08:10,984 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 08:08:10,985 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 08:08:10,985 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 08:08:10,997 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 08:08:10,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 08:08:10,998 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 08:08:10,998 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 08:08:10,998 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 08:08:10,999 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 08:08:10,999 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 08:08:10,999 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 08:08:10,999 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 08:08:10,999 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 08:08:10,999 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 08:08:11,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 08:08:11,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 08:08:11,000 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 08:08:11,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 08:08:11,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 08:08:11,000 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 08:08:11,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 08:08:11,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 08:08:11,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 08:08:11,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 08:08:11,001 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 08:08:11,001 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 08:08:11,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 08:08:11,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 08:08:11,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 08:08:11,002 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 08:08:11,002 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 08:08:11,002 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 08:08:11,003 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 08:08:11,003 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 08:08:11,004 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a0942677612f90fad3f45a67c18b7387cde689b6 [2018-11-10 08:08:11,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 08:08:11,036 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 08:08:11,039 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 08:08:11,040 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 08:08:11,040 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 08:08:11,041 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 08:08:11,079 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/data/e8378a286/038c79def76f4cc3a5eeb838856983e2/FLAG2c56b086f [2018-11-10 08:08:11,439 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 08:08:11,439 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 08:08:11,446 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/data/e8378a286/038c79def76f4cc3a5eeb838856983e2/FLAG2c56b086f [2018-11-10 08:08:11,458 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/data/e8378a286/038c79def76f4cc3a5eeb838856983e2 [2018-11-10 08:08:11,460 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 08:08:11,461 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 08:08:11,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 08:08:11,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 08:08:11,464 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 08:08:11,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,467 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70607c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11, skipping insertion in model container [2018-11-10 08:08:11,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,474 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 08:08:11,505 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 08:08:11,653 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:08:11,658 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 08:08:11,696 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 08:08:11,711 INFO L193 MainTranslator]: Completed translation [2018-11-10 08:08:11,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11 WrapperNode [2018-11-10 08:08:11,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 08:08:11,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 08:08:11,713 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 08:08:11,713 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 08:08:11,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,726 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 08:08:11,805 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 08:08:11,805 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 08:08:11,805 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 08:08:11,815 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,821 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... [2018-11-10 08:08:11,864 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 08:08:11,865 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 08:08:11,865 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 08:08:11,865 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 08:08:11,865 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:11,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 08:08:11,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 08:08:13,084 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 08:08:13,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:08:13 BoogieIcfgContainer [2018-11-10 08:08:13,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 08:08:13,085 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 08:08:13,085 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 08:08:13,089 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 08:08:13,090 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:08:13,090 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 08:08:11" (1/3) ... [2018-11-10 08:08:13,091 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a3cf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:08:13, skipping insertion in model container [2018-11-10 08:08:13,091 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:08:13,091 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 08:08:11" (2/3) ... [2018-11-10 08:08:13,092 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@24a3cf6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 08:08:13, skipping insertion in model container [2018-11-10 08:08:13,092 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 08:08:13,092 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:08:13" (3/3) ... [2018-11-10 08:08:13,094 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-11-10 08:08:13,153 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 08:08:13,154 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 08:08:13,154 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 08:08:13,154 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 08:08:13,154 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 08:08:13,154 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 08:08:13,154 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 08:08:13,154 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 08:08:13,155 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 08:08:13,181 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states. [2018-11-10 08:08:13,217 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 474 [2018-11-10 08:08:13,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:13,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:13,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:13,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:13,226 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 08:08:13,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 493 states. [2018-11-10 08:08:13,237 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 474 [2018-11-10 08:08:13,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:13,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:13,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 08:08:13,238 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:13,245 INFO L793 eck$LassoCheckResult]: Stem: 324#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 243#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 409#L116-3true [2018-11-10 08:08:13,246 INFO L795 eck$LassoCheckResult]: Loop: 409#L116-3true assume true; 416#L116-1true assume !!(add_history_type_~var~0 < 3); 366#L117true assume !(add_history_type_~history_id == 0); 226#L123true assume !(add_history_type_~history_id == 1); 479#L129true assume !(add_history_type_~history_id == 2); 192#L135true assume !(add_history_type_~history_id == 3); 191#L135-2true add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 409#L116-3true [2018-11-10 08:08:13,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:13,252 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 08:08:13,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:13,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:13,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:13,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:13,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:13,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1102018133, now seen corresponding path program 1 times [2018-11-10 08:08:13,377 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:13,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:13,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:13,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:13,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:13,392 INFO L82 PathProgramCache]: Analyzing trace with hash 444278697, now seen corresponding path program 1 times [2018-11-10 08:08:13,392 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:13,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:13,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:13,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:13,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:13,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:13,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:13,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:13,522 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:13,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:13,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:13,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:13,523 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:13,524 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:13,524 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:13,524 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:13,524 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-10 08:08:13,524 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:13,525 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:13,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:13,783 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:13,784 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:13,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,789 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,811 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,811 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_1=3} Honda state: {v_rep#funAddr~voter.offset_1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:13,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,815 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,818 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,818 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,842 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,842 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,866 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,866 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,904 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,904 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,928 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,928 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,936 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,955 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,955 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_1=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,961 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,961 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,964 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,964 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_1=-1} Honda state: {v_rep#funAddr~voter.base_1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:13,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:13,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:13,993 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:13,993 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=-8} Honda state: {ULTIMATE.start_add_history_type_~history_id=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:14,012 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:14,012 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:14,014 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:14,014 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:14,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:14,033 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:14,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:14,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:14,072 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:14,073 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:14,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:14,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:14,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:14,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:14,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:14,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:14,074 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:14,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-11-10 08:08:14,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:14,074 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:14,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,273 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:14,278 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:14,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,285 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,285 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,312 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,324 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,327 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,327 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,333 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,341 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,350 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,365 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:14,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:14,374 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:14,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:14,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:14,380 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:14,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,381 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:14,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,381 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:14,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:14,382 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:14,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:14,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:14,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:14,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:14,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:14,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:14,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:14,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:14,390 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:08:14,392 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:08:14,392 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:08:14,394 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:08:14,394 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:08:14,394 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:08:14,394 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-10 08:08:14,395 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:08:14,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:14,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:14,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:14,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:14,470 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 08:08:14,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 493 states. Second operand 4 states. [2018-11-10 08:08:14,591 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 493 states.. Second operand 4 states. Result 2052 states and 3382 transitions. Complement of second has 8 states. [2018-11-10 08:08:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:08:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:08:14,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1770 transitions. [2018-11-10 08:08:14,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1770 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-10 08:08:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:14,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1770 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-10 08:08:14,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:14,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1770 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-10 08:08:14,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:14,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2052 states and 3382 transitions. [2018-11-10 08:08:14,610 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 867 [2018-11-10 08:08:14,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2052 states to 991 states and 1636 transitions. [2018-11-10 08:08:14,621 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 937 [2018-11-10 08:08:14,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 938 [2018-11-10 08:08:14,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 991 states and 1636 transitions. [2018-11-10 08:08:14,625 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:14,625 INFO L705 BuchiCegarLoop]: Abstraction has 991 states and 1636 transitions. [2018-11-10 08:08:14,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states and 1636 transitions. [2018-11-10 08:08:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 763. [2018-11-10 08:08:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-11-10 08:08:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1269 transitions. [2018-11-10 08:08:14,671 INFO L728 BuchiCegarLoop]: Abstraction has 763 states and 1269 transitions. [2018-11-10 08:08:14,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:14,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:14,675 INFO L87 Difference]: Start difference. First operand 763 states and 1269 transitions. Second operand 3 states. [2018-11-10 08:08:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:14,757 INFO L93 Difference]: Finished difference Result 959 states and 1521 transitions. [2018-11-10 08:08:14,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:14,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 959 states and 1521 transitions. [2018-11-10 08:08:14,763 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 846 [2018-11-10 08:08:14,766 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 959 states to 905 states and 1467 transitions. [2018-11-10 08:08:14,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 888 [2018-11-10 08:08:14,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 888 [2018-11-10 08:08:14,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 905 states and 1467 transitions. [2018-11-10 08:08:14,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:14,768 INFO L705 BuchiCegarLoop]: Abstraction has 905 states and 1467 transitions. [2018-11-10 08:08:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states and 1467 transitions. [2018-11-10 08:08:14,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 444. [2018-11-10 08:08:14,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-11-10 08:08:14,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 727 transitions. [2018-11-10 08:08:14,780 INFO L728 BuchiCegarLoop]: Abstraction has 444 states and 727 transitions. [2018-11-10 08:08:14,780 INFO L608 BuchiCegarLoop]: Abstraction has 444 states and 727 transitions. [2018-11-10 08:08:14,780 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 08:08:14,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 444 states and 727 transitions. [2018-11-10 08:08:14,783 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 396 [2018-11-10 08:08:14,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:14,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:14,783 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:14,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:14,784 INFO L793 eck$LassoCheckResult]: Stem: 4703#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 4651#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4652#L116-3 assume true; 4753#L116-1 assume !(add_history_type_~var~0 < 3); 4750#L116-4 add_history_type_#res := 1; 4697#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4552#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 4553#L116-8 [2018-11-10 08:08:14,785 INFO L795 eck$LassoCheckResult]: Loop: 4553#L116-8 assume true; 4756#L116-6 assume !!(add_history_type_~var~0 < 3); 4758#L117-2 assume !(add_history_type_~history_id == 0); 4644#L123-2 assume !(add_history_type_~history_id == 1); 4645#L129-2 assume !(add_history_type_~history_id == 2); 4619#L135-3 assume !(add_history_type_~history_id == 3); 4364#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 4553#L116-8 [2018-11-10 08:08:14,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:14,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1806157978, now seen corresponding path program 1 times [2018-11-10 08:08:14,785 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:14,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:14,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:14,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:14,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:14,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:14,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:14,811 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:14,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:14,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1633825204, now seen corresponding path program 1 times [2018-11-10 08:08:14,811 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:14,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:14,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:14,839 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:14,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:14,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:14,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:14,840 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:14,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:14,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:14,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:14,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-10 08:08:14,840 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:14,840 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:14,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:14,992 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:14,993 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:14,996 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:14,996 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,001 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,001 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:15,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,058 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,058 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_3=3} Honda state: {v_rep#funAddr~voter.offset_3=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:15,062 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,062 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,065 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,065 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:15,085 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,085 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,114 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,114 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:15,122 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,142 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,142 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:15,148 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,148 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,161 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,161 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/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 [2018-11-10 08:08:15,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,184 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:15,185 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_3=-1} Honda state: {v_rep#funAddr~voter.base_3=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:15,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:15,210 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:15,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:15,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:15,270 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:15,271 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:15,271 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:15,271 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:15,271 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:15,271 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:15,271 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:15,271 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:15,271 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:15,271 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-11-10 08:08:15,272 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:15,272 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:15,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,417 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:15,417 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:15,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:15,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:15,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:15,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:15,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:15,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:15,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:15,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:15,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:15,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:15,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:15,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:15,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:15,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:15,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:15,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:15,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:15,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:15,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:15,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:15,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:15,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:15,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:15,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:15,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:15,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:15,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:15,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:15,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:15,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:15,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:15,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:15,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:15,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:15,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:15,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:15,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:15,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:15,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:15,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:15,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:15,435 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:08:15,441 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:08:15,441 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:08:15,442 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:08:15,442 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:08:15,442 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:08:15,442 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 5 Supporting invariants [] [2018-11-10 08:08:15,442 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:08:15,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:15,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:15,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:15,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:15,516 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 08:08:15,516 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 444 states and 727 transitions. cyclomatic complexity: 291 Second operand 4 states. [2018-11-10 08:08:15,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 444 states and 727 transitions. cyclomatic complexity: 291. Second operand 4 states. Result 1637 states and 2652 transitions. Complement of second has 7 states. [2018-11-10 08:08:15,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:08:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:08:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1223 transitions. [2018-11-10 08:08:15,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1223 transitions. Stem has 7 letters. Loop has 7 letters. [2018-11-10 08:08:15,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:15,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1223 transitions. Stem has 14 letters. Loop has 7 letters. [2018-11-10 08:08:15,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:15,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1223 transitions. Stem has 7 letters. Loop has 14 letters. [2018-11-10 08:08:15,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:15,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1637 states and 2652 transitions. [2018-11-10 08:08:15,611 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1014 [2018-11-10 08:08:15,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1637 states to 1178 states and 1908 transitions. [2018-11-10 08:08:15,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1102 [2018-11-10 08:08:15,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1104 [2018-11-10 08:08:15,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1178 states and 1908 transitions. [2018-11-10 08:08:15,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:15,620 INFO L705 BuchiCegarLoop]: Abstraction has 1178 states and 1908 transitions. [2018-11-10 08:08:15,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states and 1908 transitions. [2018-11-10 08:08:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 498. [2018-11-10 08:08:15,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-11-10 08:08:15,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 813 transitions. [2018-11-10 08:08:15,633 INFO L728 BuchiCegarLoop]: Abstraction has 498 states and 813 transitions. [2018-11-10 08:08:15,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:15,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:15,634 INFO L87 Difference]: Start difference. First operand 498 states and 813 transitions. Second operand 3 states. [2018-11-10 08:08:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:15,690 INFO L93 Difference]: Finished difference Result 975 states and 1593 transitions. [2018-11-10 08:08:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:15,692 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 975 states and 1593 transitions. [2018-11-10 08:08:15,699 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 564 [2018-11-10 08:08:15,703 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 975 states to 975 states and 1593 transitions. [2018-11-10 08:08:15,703 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 832 [2018-11-10 08:08:15,704 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 832 [2018-11-10 08:08:15,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 975 states and 1593 transitions. [2018-11-10 08:08:15,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:15,705 INFO L705 BuchiCegarLoop]: Abstraction has 975 states and 1593 transitions. [2018-11-10 08:08:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states and 1593 transitions. [2018-11-10 08:08:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 504. [2018-11-10 08:08:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-10 08:08:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 819 transitions. [2018-11-10 08:08:15,715 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 819 transitions. [2018-11-10 08:08:15,715 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 819 transitions. [2018-11-10 08:08:15,715 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 08:08:15,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 819 transitions. [2018-11-10 08:08:15,717 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 339 [2018-11-10 08:08:15,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:15,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:15,719 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:15,719 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:15,719 INFO L793 eck$LassoCheckResult]: Stem: 8368#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 8310#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 8311#L116-3 assume true; 8427#L116-1 assume !!(add_history_type_~var~0 < 3); 8406#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8046#L171 assume read_history_bool_~history_id == 0; 8047#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 8053#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8182#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8360#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8201#L255 assume init_~tmp~1 == 0;init_#res := 0; 8079#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 8081#L558-3 [2018-11-10 08:08:15,721 INFO L795 eck$LassoCheckResult]: Loop: 8081#L558-3 assume true; 8439#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8070#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8071#L236-2 assume { :end_inline_write_history_bool } true; 8179#L390 assume ~gate1Failed~0 % 256 != 0; 8064#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 8065#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 8082#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8043#L226-2 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8044#L236-5 assume { :end_inline_write_history_bool } true; 8139#L421 assume ~gate2Failed~0 % 256 != 0; 8019#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 8009#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 8010#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 8370#L226-4 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 8130#L236-8 assume { :end_inline_write_history_bool } true; 8173#L452 assume ~gate3Failed~0 % 256 != 0; 8210#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 8194#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 8195#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 8206#L486 assume ~VALUE1~0 == ~VALUE2~0; 8208#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 7959#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 8293#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 8292#L211-2 assume { :end_inline_write_history_int8 } true; 8286#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 8287#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 8284#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 8285#L171-12 assume read_history_bool_~history_id == 0; 8401#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 8113#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 8153#L307 assume !(check_~tmp___3~0 % 256 == 0); 8257#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 8319#L151-7 assume read_history_int8_~history_id == 3; 8334#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 8226#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 8190#L346 assume !(check_~tmp___10~0 > -2); 8174#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 8175#L151-9 assume read_history_int8_~history_id == 3; 8329#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 8221#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 8277#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 8189#L366-1 check_#res := 1; 8020#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 8021#L583-72 assume !(assert_~arg % 256 == 0); 8200#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 8081#L558-3 [2018-11-10 08:08:15,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:15,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1149248423, now seen corresponding path program 1 times [2018-11-10 08:08:15,722 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:15,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:15,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:15,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:15,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:15,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:08:15,755 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:15,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash 459134191, now seen corresponding path program 1 times [2018-11-10 08:08:15,755 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:15,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:15,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:15,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:15,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:15,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:15,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:15,785 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:15,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:15,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:15,786 INFO L87 Difference]: Start difference. First operand 504 states and 819 transitions. cyclomatic complexity: 323 Second operand 3 states. [2018-11-10 08:08:15,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:15,801 INFO L93 Difference]: Finished difference Result 505 states and 819 transitions. [2018-11-10 08:08:15,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:15,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 505 states and 819 transitions. [2018-11-10 08:08:15,805 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 339 [2018-11-10 08:08:15,807 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 505 states to 504 states and 815 transitions. [2018-11-10 08:08:15,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 430 [2018-11-10 08:08:15,808 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 430 [2018-11-10 08:08:15,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 504 states and 815 transitions. [2018-11-10 08:08:15,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:15,808 INFO L705 BuchiCegarLoop]: Abstraction has 504 states and 815 transitions. [2018-11-10 08:08:15,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states and 815 transitions. [2018-11-10 08:08:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 504. [2018-11-10 08:08:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2018-11-10 08:08:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 815 transitions. [2018-11-10 08:08:15,818 INFO L728 BuchiCegarLoop]: Abstraction has 504 states and 815 transitions. [2018-11-10 08:08:15,819 INFO L608 BuchiCegarLoop]: Abstraction has 504 states and 815 transitions. [2018-11-10 08:08:15,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 08:08:15,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 504 states and 815 transitions. [2018-11-10 08:08:15,821 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 339 [2018-11-10 08:08:15,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:15,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:15,822 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:15,822 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:15,823 INFO L793 eck$LassoCheckResult]: Stem: 9384#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 9326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9327#L116-3 assume true; 9443#L116-1 assume !!(add_history_type_~var~0 < 3); 9422#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9062#L171 assume read_history_bool_~history_id == 0; 9063#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 9069#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 9198#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 9376#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 9217#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9218#L116-8 assume true; 9447#L116-6 assume !!(add_history_type_~var~0 < 3); 9452#L117-2 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 9411#L171-3 assume read_history_bool_~history_id == 0; 9414#L172-3 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 9056#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 9163#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 9007#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 9093#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 9094#L116-13 assume true; 9433#L116-11 assume !!(add_history_type_~var~0 < 3); 9434#L117-4 [2018-11-10 08:08:15,823 INFO L795 eck$LassoCheckResult]: Loop: 9434#L117-4 assume !(add_history_type_~history_id == 0); 9313#L123-4 assume !(add_history_type_~history_id == 1); 9314#L129-4 assume !(add_history_type_~history_id == 2); 9285#L135-6 assume !(add_history_type_~history_id == 3); 8998#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 9459#L116-13 assume true; 9458#L116-11 assume !!(add_history_type_~var~0 < 3); 9434#L117-4 [2018-11-10 08:08:15,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:15,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1206696970, now seen corresponding path program 1 times [2018-11-10 08:08:15,823 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:15,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:15,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:15,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:15,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:15,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:15,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:15,860 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:15,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1214143545, now seen corresponding path program 1 times [2018-11-10 08:08:15,860 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:15,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:15,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:15,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:15,908 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:15,908 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:15,908 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:15,908 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:15,909 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:15,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:15,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:15,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:15,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 08:08:15,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:15,909 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:15,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:15,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,065 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:16,065 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,070 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 24 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:16,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,167 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:16,168 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:16,168 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:16,168 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:16,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:16,169 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:16,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:16,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:16,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-11-10 08:08:16,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:16,169 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:16,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,284 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:16,284 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:16,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:16,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:16,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:16,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:16,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:16,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:16,286 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:16,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:16,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:16,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:16,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:16,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:16,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:16,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:16,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:16,291 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:16,293 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:08:16,294 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:08:16,295 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:08:16,295 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:08:16,295 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:08:16,295 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:08:16,295 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-10 08:08:16,296 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:08:16,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:16,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:16,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:16,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:16,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:16,398 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 08:08:16,398 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 504 states and 815 transitions. cyclomatic complexity: 319 Second operand 4 states. [2018-11-10 08:08:16,428 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 504 states and 815 transitions. cyclomatic complexity: 319. Second operand 4 states. Result 567 states and 919 transitions. Complement of second has 7 states. [2018-11-10 08:08:16,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:08:16,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:08:16,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 225 transitions. [2018-11-10 08:08:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 22 letters. Loop has 7 letters. [2018-11-10 08:08:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:16,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 29 letters. Loop has 7 letters. [2018-11-10 08:08:16,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:16,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 225 transitions. Stem has 22 letters. Loop has 14 letters. [2018-11-10 08:08:16,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:16,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 567 states and 919 transitions. [2018-11-10 08:08:16,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2018-11-10 08:08:16,442 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 567 states to 562 states and 910 transitions. [2018-11-10 08:08:16,442 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429 [2018-11-10 08:08:16,443 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 431 [2018-11-10 08:08:16,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 562 states and 910 transitions. [2018-11-10 08:08:16,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:16,443 INFO L705 BuchiCegarLoop]: Abstraction has 562 states and 910 transitions. [2018-11-10 08:08:16,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states and 910 transitions. [2018-11-10 08:08:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 557. [2018-11-10 08:08:16,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-11-10 08:08:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 905 transitions. [2018-11-10 08:08:16,451 INFO L728 BuchiCegarLoop]: Abstraction has 557 states and 905 transitions. [2018-11-10 08:08:16,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:08:16,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:08:16,451 INFO L87 Difference]: Start difference. First operand 557 states and 905 transitions. Second operand 4 states. [2018-11-10 08:08:16,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:16,506 INFO L93 Difference]: Finished difference Result 791 states and 1276 transitions. [2018-11-10 08:08:16,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:08:16,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 791 states and 1276 transitions. [2018-11-10 08:08:16,511 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 507 [2018-11-10 08:08:16,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 791 states to 774 states and 1249 transitions. [2018-11-10 08:08:16,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 643 [2018-11-10 08:08:16,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 643 [2018-11-10 08:08:16,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 774 states and 1249 transitions. [2018-11-10 08:08:16,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:16,516 INFO L705 BuchiCegarLoop]: Abstraction has 774 states and 1249 transitions. [2018-11-10 08:08:16,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states and 1249 transitions. [2018-11-10 08:08:16,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 542. [2018-11-10 08:08:16,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-11-10 08:08:16,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 879 transitions. [2018-11-10 08:08:16,525 INFO L728 BuchiCegarLoop]: Abstraction has 542 states and 879 transitions. [2018-11-10 08:08:16,526 INFO L608 BuchiCegarLoop]: Abstraction has 542 states and 879 transitions. [2018-11-10 08:08:16,526 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 08:08:16,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 542 states and 879 transitions. [2018-11-10 08:08:16,528 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 282 [2018-11-10 08:08:16,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:16,528 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:16,529 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:16,529 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:16,530 INFO L793 eck$LassoCheckResult]: Stem: 11946#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 11883#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11884#L116-3 assume true; 12011#L116-1 assume !!(add_history_type_~var~0 < 3); 11992#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11608#L171 assume read_history_bool_~history_id == 0; 11609#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 11612#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11750#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11833#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 11834#L116-3 assume true; 12012#L116-1 assume !(add_history_type_~var~0 < 3); 12008#L116-4 add_history_type_#res := 1; 11942#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11768#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11769#L116-8 assume true; 12015#L116-6 assume !!(add_history_type_~var~0 < 3); 12021#L117-2 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11980#L171-3 assume read_history_bool_~history_id == 0; 11983#L172-3 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 11602#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11709#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11541#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11633#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11634#L116-13 assume true; 12000#L116-11 assume !!(add_history_type_~var~0 < 3); 11971#L117-4 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 11973#L171-6 assume read_history_bool_~history_id == 0; 11969#L172-6 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 11640#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11680#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11531#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11881#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 11882#L116-18 assume true; 12006#L116-16 assume !!(add_history_type_~var~0 < 3); 12007#L117-6 [2018-11-10 08:08:16,530 INFO L795 eck$LassoCheckResult]: Loop: 12007#L117-6 assume !(add_history_type_~history_id == 0); 11865#L123-6 assume !(add_history_type_~history_id == 1); 11866#L129-6 assume !(add_history_type_~history_id == 2); 11581#L135-9 assume !(add_history_type_~history_id == 3); 11521#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 12026#L116-18 assume true; 12024#L116-16 assume !!(add_history_type_~var~0 < 3); 12007#L117-6 [2018-11-10 08:08:16,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:16,530 INFO L82 PathProgramCache]: Analyzing trace with hash 986945626, now seen corresponding path program 1 times [2018-11-10 08:08:16,530 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:16,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:16,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:16,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:16,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:16,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:16,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:08:16,562 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:16,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 682336474, now seen corresponding path program 1 times [2018-11-10 08:08:16,562 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:16,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:16,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:16,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:16,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:16,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:16,599 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:16,599 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:16,599 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:16,599 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:16,599 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:16,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,600 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:16,600 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:16,600 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-10 08:08:16,600 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:16,600 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:16,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:16,726 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:16,726 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,731 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,731 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,734 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,734 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_7=-1} Honda state: {v_rep#funAddr~voter.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,751 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,769 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,769 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.offset_7=3} Honda state: {v_rep#funAddr~voter.offset_7=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 27 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,775 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,775 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_#t~post4=0} Honda state: {ULTIMATE.start_add_history_type_#t~post4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,793 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,793 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,811 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,811 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 29 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,817 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,817 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 30 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,834 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,852 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,852 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,855 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,857 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,858 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=-8} Honda state: {ULTIMATE.start_add_history_type_~history_id=-8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,876 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,876 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,879 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,879 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,897 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:16,899 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:16,899 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_7=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:16,918 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:16,938 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:16,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:17,010 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:17,011 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:17,011 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:17,011 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:17,011 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:17,012 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:17,012 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:17,012 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:17,012 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:17,012 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-11-10 08:08:17,012 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:17,012 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:17,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:17,135 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:17,135 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:17,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,137 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:17,137 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:17,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:17,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:17,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:17,141 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:17,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:17,144 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:17,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,146 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 08:08:17,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,146 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 08:08:17,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:17,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:17,149 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:17,151 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:17,153 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:17,154 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,156 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:17,156 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:17,159 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,160 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:08:17,161 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:08:17,163 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:17,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:17,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:17,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:17,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:17,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:17,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:17,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:17,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:17,166 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:08:17,167 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:08:17,167 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:08:17,167 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:08:17,168 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:08:17,168 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:08:17,168 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_add_history_type_~var~0) = -2*ULTIMATE.start_add_history_type_~var~0 + 3 Supporting invariants [] [2018-11-10 08:08:17,168 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:08:17,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:17,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:17,260 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-10 08:08:17,260 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 542 states and 879 transitions. cyclomatic complexity: 345 Second operand 4 states. [2018-11-10 08:08:17,288 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 542 states and 879 transitions. cyclomatic complexity: 345. Second operand 4 states. Result 1283 states and 2077 transitions. Complement of second has 6 states. [2018-11-10 08:08:17,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:08:17,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-10 08:08:17,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1049 transitions. [2018-11-10 08:08:17,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1049 transitions. Stem has 35 letters. Loop has 7 letters. [2018-11-10 08:08:17,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:17,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1049 transitions. Stem has 42 letters. Loop has 7 letters. [2018-11-10 08:08:17,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:17,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1049 transitions. Stem has 35 letters. Loop has 14 letters. [2018-11-10 08:08:17,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:17,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1283 states and 2077 transitions. [2018-11-10 08:08:17,296 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 450 [2018-11-10 08:08:17,299 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1283 states to 826 states and 1338 transitions. [2018-11-10 08:08:17,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2018-11-10 08:08:17,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 638 [2018-11-10 08:08:17,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 826 states and 1338 transitions. [2018-11-10 08:08:17,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:17,300 INFO L705 BuchiCegarLoop]: Abstraction has 826 states and 1338 transitions. [2018-11-10 08:08:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states and 1338 transitions. [2018-11-10 08:08:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 595. [2018-11-10 08:08:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-11-10 08:08:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 969 transitions. [2018-11-10 08:08:17,307 INFO L728 BuchiCegarLoop]: Abstraction has 595 states and 969 transitions. [2018-11-10 08:08:17,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:08:17,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:08:17,308 INFO L87 Difference]: Start difference. First operand 595 states and 969 transitions. Second operand 5 states. [2018-11-10 08:08:17,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:17,378 INFO L93 Difference]: Finished difference Result 735 states and 1177 transitions. [2018-11-10 08:08:17,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 08:08:17,379 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 735 states and 1177 transitions. [2018-11-10 08:08:17,381 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 450 [2018-11-10 08:08:17,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 735 states to 735 states and 1177 transitions. [2018-11-10 08:08:17,383 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 598 [2018-11-10 08:08:17,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 598 [2018-11-10 08:08:17,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 735 states and 1177 transitions. [2018-11-10 08:08:17,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:17,384 INFO L705 BuchiCegarLoop]: Abstraction has 735 states and 1177 transitions. [2018-11-10 08:08:17,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states and 1177 transitions. [2018-11-10 08:08:17,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 503. [2018-11-10 08:08:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-10 08:08:17,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 807 transitions. [2018-11-10 08:08:17,391 INFO L728 BuchiCegarLoop]: Abstraction has 503 states and 807 transitions. [2018-11-10 08:08:17,391 INFO L608 BuchiCegarLoop]: Abstraction has 503 states and 807 transitions. [2018-11-10 08:08:17,391 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 08:08:17,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 503 states and 807 transitions. [2018-11-10 08:08:17,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2018-11-10 08:08:17,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:17,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:17,395 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,395 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,395 INFO L793 eck$LassoCheckResult]: Stem: 15089#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 14829#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14830#L116-3 assume true; 15251#L116-1 assume !!(add_history_type_~var~0 < 3); 15210#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15034#L171 assume read_history_bool_~history_id == 0; 15035#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14805#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 15008#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 15009#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 15252#L116-3 assume true; 15253#L116-1 assume !(add_history_type_~var~0 < 3); 15247#L116-4 add_history_type_#res := 1; 15060#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15061#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15191#L116-8 assume true; 15271#L116-6 assume !!(add_history_type_~var~0 < 3); 15185#L117-2 assume !(add_history_type_~history_id == 0); 15186#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15254#L171-4 assume read_history_bool_~history_id == 0; 15183#L172-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14846#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14885#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14857#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15054#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15055#L116-13 assume true; 15229#L116-11 assume !!(add_history_type_~var~0 < 3); 15175#L117-4 assume !(add_history_type_~history_id == 0); 15176#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15277#L171-7 assume read_history_bool_~history_id == 0; 15169#L172-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14935#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14878#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14851#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14812#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 14813#L116-18 assume true; 15240#L116-16 assume !!(add_history_type_~var~0 < 3); 15164#L117-6 assume !(add_history_type_~history_id == 0); 15165#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15268#L171-10 assume read_history_bool_~history_id == 0; 15198#L172-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14915#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14869#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14841#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15090#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 15056#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 15057#L558-3 [2018-11-10 08:08:17,395 INFO L795 eck$LassoCheckResult]: Loop: 15057#L558-3 assume true; 15301#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15046#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15047#L236-2 assume { :end_inline_write_history_bool } true; 15153#L390 assume ~gate1Failed~0 % 256 != 0; 15042#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15043#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 15058#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15031#L226-2 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15032#L236-5 assume { :end_inline_write_history_bool } true; 15112#L421 assume ~gate2Failed~0 % 256 != 0; 14962#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14910#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 14889#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 15100#L226-4 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15092#L236-8 assume { :end_inline_write_history_bool } true; 15140#L452 assume ~gate3Failed~0 % 256 != 0; 15203#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15171#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 15172#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 15200#L486 assume ~VALUE1~0 == ~VALUE2~0; 15202#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 14822#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 15302#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 15245#L211-2 assume { :end_inline_write_history_int8 } true; 15296#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 15297#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 15084#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 15259#L171-12 assume read_history_bool_~history_id == 0; 15193#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 14964#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14837#L307 assume !(check_~tmp___3~0 % 256 == 0); 14838#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 14849#L151-7 assume read_history_int8_~history_id == 3; 14923#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 14924#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14930#L346 assume !(check_~tmp___10~0 > -2); 15141#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15142#L151-9 assume read_history_int8_~history_id == 3; 14911#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 14913#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14918#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14986#L366-1 check_#res := 1; 14976#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14977#L583-72 assume !(assert_~arg % 256 == 0); 15189#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 15057#L558-3 [2018-11-10 08:08:17,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1672512711, now seen corresponding path program 1 times [2018-11-10 08:08:17,396 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:17,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:17,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:08:17,457 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:17,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,457 INFO L82 PathProgramCache]: Analyzing trace with hash 459134191, now seen corresponding path program 2 times [2018-11-10 08:08:17,457 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:17,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:17,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:17,478 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:17,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:17,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:17,479 INFO L87 Difference]: Start difference. First operand 503 states and 807 transitions. cyclomatic complexity: 309 Second operand 3 states. [2018-11-10 08:08:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:17,505 INFO L93 Difference]: Finished difference Result 516 states and 823 transitions. [2018-11-10 08:08:17,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:17,506 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 516 states and 823 transitions. [2018-11-10 08:08:17,508 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 236 [2018-11-10 08:08:17,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 516 states to 516 states and 823 transitions. [2018-11-10 08:08:17,509 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 379 [2018-11-10 08:08:17,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 379 [2018-11-10 08:08:17,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 516 states and 823 transitions. [2018-11-10 08:08:17,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:17,510 INFO L705 BuchiCegarLoop]: Abstraction has 516 states and 823 transitions. [2018-11-10 08:08:17,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states and 823 transitions. [2018-11-10 08:08:17,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 503. [2018-11-10 08:08:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-11-10 08:08:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 805 transitions. [2018-11-10 08:08:17,517 INFO L728 BuchiCegarLoop]: Abstraction has 503 states and 805 transitions. [2018-11-10 08:08:17,517 INFO L608 BuchiCegarLoop]: Abstraction has 503 states and 805 transitions. [2018-11-10 08:08:17,517 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 08:08:17,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 503 states and 805 transitions. [2018-11-10 08:08:17,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2018-11-10 08:08:17,520 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:17,520 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:17,522 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,522 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,522 INFO L793 eck$LassoCheckResult]: Stem: 16117#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 15857#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15858#L116-3 assume true; 16278#L116-1 assume !!(add_history_type_~var~0 < 3); 16238#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16061#L171 assume read_history_bool_~history_id == 0; 16062#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15833#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16042#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16043#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 16279#L116-3 assume true; 16280#L116-1 assume !(add_history_type_~var~0 < 3); 16274#L116-4 add_history_type_#res := 1; 16087#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16088#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16219#L116-8 assume true; 16298#L116-6 assume !!(add_history_type_~var~0 < 3); 16213#L117-2 assume !(add_history_type_~history_id == 0); 16214#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16281#L171-4 assume read_history_bool_~history_id == 0; 16211#L172-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15874#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15911#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15885#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16080#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 16081#L116-13 assume true; 16257#L116-11 assume !!(add_history_type_~var~0 < 3); 16203#L117-4 assume !(add_history_type_~history_id == 0); 16204#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16304#L171-7 assume read_history_bool_~history_id == 0; 16196#L172-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15960#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15906#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15878#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15840#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 15841#L116-18 assume true; 16267#L116-16 assume !!(add_history_type_~var~0 < 3); 16192#L117-6 assume !(add_history_type_~history_id == 0); 16193#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16294#L171-10 assume read_history_bool_~history_id == 0; 16226#L172-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15939#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15897#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15866#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16118#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 16083#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 16084#L558-3 [2018-11-10 08:08:17,522 INFO L795 eck$LassoCheckResult]: Loop: 16084#L558-3 assume true; 16328#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16075#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 16076#L236-2 assume { :end_inline_write_history_bool } true; 16181#L390 assume ~gate1Failed~0 % 256 != 0; 16069#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16070#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 16085#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16059#L226-2 assume !(write_history_bool_~history_id == 0); 16060#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16092#L236-5 assume { :end_inline_write_history_bool } true; 16140#L421 assume ~gate2Failed~0 % 256 != 0; 15990#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15942#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 15917#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 16130#L226-4 assume !(write_history_bool_~history_id == 0); 16119#L231-4 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16120#L236-8 assume { :end_inline_write_history_bool } true; 16168#L452 assume ~gate3Failed~0 % 256 != 0; 16231#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 16199#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 16200#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 16228#L486 assume ~VALUE1~0 == ~VALUE2~0; 16230#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 15856#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 16329#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 16272#L211-2 assume { :end_inline_write_history_int8 } true; 16323#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 16324#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 16112#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 16286#L171-12 assume read_history_bool_~history_id == 0; 16221#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 15992#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15870#L307 assume !(check_~tmp___3~0 % 256 == 0); 15871#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 15882#L151-7 assume read_history_int8_~history_id == 3; 15955#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 15956#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15958#L346 assume !(check_~tmp___10~0 > -2); 16169#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 16170#L151-9 assume read_history_int8_~history_id == 3; 15943#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 15945#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15946#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 16014#L366-1 check_#res := 1; 16004#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 16005#L583-72 assume !(assert_~arg % 256 == 0); 16217#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 16084#L558-3 [2018-11-10 08:08:17,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1672512711, now seen corresponding path program 2 times [2018-11-10 08:08:17,523 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:17,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:17,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 08:08:17,553 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:17,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1434876098, now seen corresponding path program 1 times [2018-11-10 08:08:17,554 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,555 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:17,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:17,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:17,587 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:17,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:08:17,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:08:17,588 INFO L87 Difference]: Start difference. First operand 503 states and 805 transitions. cyclomatic complexity: 307 Second operand 5 states. [2018-11-10 08:08:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:17,786 INFO L93 Difference]: Finished difference Result 1056 states and 1601 transitions. [2018-11-10 08:08:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 08:08:17,788 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1056 states and 1601 transitions. [2018-11-10 08:08:17,791 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 680 [2018-11-10 08:08:17,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1056 states to 1056 states and 1601 transitions. [2018-11-10 08:08:17,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 883 [2018-11-10 08:08:17,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 883 [2018-11-10 08:08:17,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1056 states and 1601 transitions. [2018-11-10 08:08:17,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:17,795 INFO L705 BuchiCegarLoop]: Abstraction has 1056 states and 1601 transitions. [2018-11-10 08:08:17,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states and 1601 transitions. [2018-11-10 08:08:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 471. [2018-11-10 08:08:17,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-10 08:08:17,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 725 transitions. [2018-11-10 08:08:17,802 INFO L728 BuchiCegarLoop]: Abstraction has 471 states and 725 transitions. [2018-11-10 08:08:17,802 INFO L608 BuchiCegarLoop]: Abstraction has 471 states and 725 transitions. [2018-11-10 08:08:17,802 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 08:08:17,802 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states and 725 transitions. [2018-11-10 08:08:17,803 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 217 [2018-11-10 08:08:17,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:17,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:17,805 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,805 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,805 INFO L793 eck$LassoCheckResult]: Stem: 17690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 17434#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17435#L116-3 assume true; 17823#L116-1 assume !!(add_history_type_~var~0 < 3); 17786#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17634#L171 assume read_history_bool_~history_id == 0; 17635#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 17410#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17615#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17616#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 17824#L116-3 assume true; 17825#L116-1 assume !(add_history_type_~var~0 < 3); 17819#L116-4 add_history_type_#res := 1; 17660#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17661#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17773#L116-8 assume true; 17843#L116-6 assume !!(add_history_type_~var~0 < 3); 17768#L117-2 assume !(add_history_type_~history_id == 0); 17769#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17826#L171-4 assume !(read_history_bool_~history_id == 0); 17705#L181-4 assume read_history_bool_~history_id == 1; 17706#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 17587#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17480#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17454#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17653#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17654#L116-13 assume true; 17803#L116-11 assume !!(add_history_type_~var~0 < 3); 17762#L117-4 assume !(add_history_type_~history_id == 0); 17763#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17849#L171-7 assume !(read_history_bool_~history_id == 0); 17734#L181-7 assume read_history_bool_~history_id == 1; 17735#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 17529#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17475#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17447#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17417#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 17418#L116-18 assume true; 17812#L116-16 assume !!(add_history_type_~var~0 < 3); 17753#L117-6 assume !(add_history_type_~history_id == 0); 17754#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17839#L171-10 assume !(read_history_bool_~history_id == 0); 17722#L181-10 assume read_history_bool_~history_id == 1; 17723#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 17508#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17466#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17439#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17691#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 17656#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 17657#L558-3 [2018-11-10 08:08:17,805 INFO L795 eck$LassoCheckResult]: Loop: 17657#L558-3 assume true; 17873#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17648#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 17649#L236-2 assume { :end_inline_write_history_bool } true; 17746#L390 assume ~gate1Failed~0 % 256 != 0; 17642#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17643#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 17658#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17632#L226-2 assume !(write_history_bool_~history_id == 0); 17633#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17665#L236-5 assume { :end_inline_write_history_bool } true; 17713#L421 assume ~gate2Failed~0 % 256 != 0; 17561#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17511#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 17486#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 17703#L226-4 assume !(write_history_bool_~history_id == 0); 17692#L231-4 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17693#L236-8 assume { :end_inline_write_history_bool } true; 17740#L452 assume ~gate3Failed~0 % 256 != 0; 17781#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17758#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 17759#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 17778#L486 assume ~VALUE1~0 == ~VALUE2~0; 17780#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 17433#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 17874#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17817#L211-2 assume { :end_inline_write_history_int8 } true; 17868#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 17869#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 17685#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 17831#L171-12 assume read_history_bool_~history_id == 0; 17775#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 17563#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17443#L307 assume !(check_~tmp___3~0 % 256 == 0); 17444#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17451#L151-7 assume read_history_int8_~history_id == 3; 17524#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 17525#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17527#L346 assume !(check_~tmp___10~0 > -2); 17741#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 17742#L151-9 assume read_history_int8_~history_id == 3; 17512#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 17514#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17515#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17585#L366-1 check_#res := 1; 17575#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17576#L583-72 assume !(assert_~arg % 256 == 0); 17772#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 17657#L558-3 [2018-11-10 08:08:17,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 1 times [2018-11-10 08:08:17,806 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:17,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:17,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:17,842 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:17,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1434876098, now seen corresponding path program 2 times [2018-11-10 08:08:17,842 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,842 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:17,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:17,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:17,862 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:17,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:17,863 INFO L87 Difference]: Start difference. First operand 471 states and 725 transitions. cyclomatic complexity: 259 Second operand 3 states. [2018-11-10 08:08:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:17,895 INFO L93 Difference]: Finished difference Result 495 states and 758 transitions. [2018-11-10 08:08:17,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:17,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 495 states and 758 transitions. [2018-11-10 08:08:17,898 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 239 [2018-11-10 08:08:17,899 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 495 states to 495 states and 758 transitions. [2018-11-10 08:08:17,899 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 370 [2018-11-10 08:08:17,900 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 370 [2018-11-10 08:08:17,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 495 states and 758 transitions. [2018-11-10 08:08:17,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:17,900 INFO L705 BuchiCegarLoop]: Abstraction has 495 states and 758 transitions. [2018-11-10 08:08:17,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states and 758 transitions. [2018-11-10 08:08:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 471. [2018-11-10 08:08:17,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-10 08:08:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 724 transitions. [2018-11-10 08:08:17,906 INFO L728 BuchiCegarLoop]: Abstraction has 471 states and 724 transitions. [2018-11-10 08:08:17,906 INFO L608 BuchiCegarLoop]: Abstraction has 471 states and 724 transitions. [2018-11-10 08:08:17,906 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-10 08:08:17,906 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 471 states and 724 transitions. [2018-11-10 08:08:17,908 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 217 [2018-11-10 08:08:17,908 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:17,908 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:17,909 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,909 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:17,909 INFO L793 eck$LassoCheckResult]: Stem: 18664#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 18408#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18409#L116-3 assume true; 18797#L116-1 assume !!(add_history_type_~var~0 < 3); 18760#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18608#L171 assume read_history_bool_~history_id == 0; 18609#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 18381#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18583#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18584#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 18798#L116-3 assume true; 18799#L116-1 assume !(add_history_type_~var~0 < 3); 18792#L116-4 add_history_type_#res := 1; 18633#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18634#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18747#L116-8 assume true; 18817#L116-6 assume !!(add_history_type_~var~0 < 3); 18742#L117-2 assume !(add_history_type_~history_id == 0); 18743#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18800#L171-4 assume !(read_history_bool_~history_id == 0); 18679#L181-4 assume read_history_bool_~history_id == 1; 18680#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 18561#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18454#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18428#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18627#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18628#L116-13 assume true; 18777#L116-11 assume !!(add_history_type_~var~0 < 3); 18736#L117-4 assume !(add_history_type_~history_id == 0); 18737#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18823#L171-7 assume !(read_history_bool_~history_id == 0); 18708#L181-7 assume read_history_bool_~history_id == 1; 18709#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 18503#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18449#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18421#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18391#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 18392#L116-18 assume true; 18786#L116-16 assume !!(add_history_type_~var~0 < 3); 18727#L117-6 assume !(add_history_type_~history_id == 0); 18728#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18813#L171-10 assume !(read_history_bool_~history_id == 0); 18696#L181-10 assume read_history_bool_~history_id == 1; 18697#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 18482#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18440#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18413#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18665#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 18630#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 18631#L558-3 [2018-11-10 08:08:17,910 INFO L795 eck$LassoCheckResult]: Loop: 18631#L558-3 assume true; 18847#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18622#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 18623#L236-2 assume { :end_inline_write_history_bool } true; 18720#L390 assume ~gate1Failed~0 % 256 != 0; 18616#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18617#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 18632#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18606#L226-2 assume !(write_history_bool_~history_id == 0); 18607#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 18639#L236-5 assume { :end_inline_write_history_bool } true; 18687#L421 assume ~gate2Failed~0 % 256 != 0; 18535#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18485#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 18460#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 18676#L226-4 assume !(write_history_bool_~history_id == 0); 18666#L231-4 assume !(write_history_bool_~history_id == 1); 18667#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 18677#L236-8 assume { :end_inline_write_history_bool } true; 18714#L452 assume ~gate3Failed~0 % 256 != 0; 18755#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 18732#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 18733#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 18752#L486 assume ~VALUE1~0 == ~VALUE2~0; 18754#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 18407#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 18848#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 18791#L211-2 assume { :end_inline_write_history_int8 } true; 18842#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 18843#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 18659#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 18805#L171-12 assume read_history_bool_~history_id == 0; 18749#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 18537#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18417#L307 assume !(check_~tmp___3~0 % 256 == 0); 18418#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18425#L151-7 assume read_history_int8_~history_id == 3; 18498#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 18499#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18501#L346 assume !(check_~tmp___10~0 > -2); 18715#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 18716#L151-9 assume read_history_int8_~history_id == 3; 18486#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 18488#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18489#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18559#L366-1 check_#res := 1; 18549#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18550#L583-72 assume !(assert_~arg % 256 == 0); 18746#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 18631#L558-3 [2018-11-10 08:08:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 2 times [2018-11-10 08:08:17,910 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:17,953 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:17,953 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:17,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:17,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1045201859, now seen corresponding path program 1 times [2018-11-10 08:08:17,954 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:17,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:17,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,955 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:17,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:17,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:17,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:17,993 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:17,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:17,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:17,994 INFO L87 Difference]: Start difference. First operand 471 states and 724 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-10 08:08:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:18,021 INFO L93 Difference]: Finished difference Result 671 states and 1036 transitions. [2018-11-10 08:08:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:18,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 671 states and 1036 transitions. [2018-11-10 08:08:18,025 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 417 [2018-11-10 08:08:18,027 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 671 states to 671 states and 1036 transitions. [2018-11-10 08:08:18,027 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 546 [2018-11-10 08:08:18,028 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 546 [2018-11-10 08:08:18,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 671 states and 1036 transitions. [2018-11-10 08:08:18,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:18,028 INFO L705 BuchiCegarLoop]: Abstraction has 671 states and 1036 transitions. [2018-11-10 08:08:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states and 1036 transitions. [2018-11-10 08:08:18,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 522. [2018-11-10 08:08:18,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-11-10 08:08:18,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 798 transitions. [2018-11-10 08:08:18,038 INFO L728 BuchiCegarLoop]: Abstraction has 522 states and 798 transitions. [2018-11-10 08:08:18,038 INFO L608 BuchiCegarLoop]: Abstraction has 522 states and 798 transitions. [2018-11-10 08:08:18,038 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-10 08:08:18,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 522 states and 798 transitions. [2018-11-10 08:08:18,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 268 [2018-11-10 08:08:18,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:18,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:18,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,042 INFO L793 eck$LassoCheckResult]: Stem: 19814#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 19558#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19559#L116-3 assume true; 19952#L116-1 assume !!(add_history_type_~var~0 < 3); 19912#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19758#L171 assume read_history_bool_~history_id == 0; 19759#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 19531#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 19733#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 19734#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 19953#L116-3 assume true; 19954#L116-1 assume !(add_history_type_~var~0 < 3); 19947#L116-4 add_history_type_#res := 1; 19784#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 19785#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19898#L116-8 assume true; 19974#L116-6 assume !!(add_history_type_~var~0 < 3); 19893#L117-2 assume !(add_history_type_~history_id == 0); 19894#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19955#L171-4 assume !(read_history_bool_~history_id == 0); 19829#L181-4 assume read_history_bool_~history_id == 1; 19830#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 19711#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19604#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19578#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 19777#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19778#L116-13 assume true; 19929#L116-11 assume !!(add_history_type_~var~0 < 3); 19887#L117-4 assume !(add_history_type_~history_id == 0); 19888#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19982#L171-7 assume !(read_history_bool_~history_id == 0); 19858#L181-7 assume read_history_bool_~history_id == 1; 19859#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 19656#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19599#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19571#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19541#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 19542#L116-18 assume true; 19942#L116-16 assume !!(add_history_type_~var~0 < 3); 19877#L117-6 assume !(add_history_type_~history_id == 0); 19878#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19970#L171-10 assume !(read_history_bool_~history_id == 0); 19846#L181-10 assume read_history_bool_~history_id == 1; 19847#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 19632#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19590#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19563#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 19815#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 19780#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 19781#L558-3 [2018-11-10 08:08:18,042 INFO L795 eck$LassoCheckResult]: Loop: 19781#L558-3 assume true; 20009#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19772#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 19773#L236-2 assume { :end_inline_write_history_bool } true; 19870#L390 assume ~gate1Failed~0 % 256 != 0; 19766#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 19767#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 19782#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 19881#L226-2 assume !(write_history_bool_~history_id == 0); 20044#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 20041#L236-5 assume { :end_inline_write_history_bool } true; 20039#L421 assume ~gate2Failed~0 % 256 != 0; 20038#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 20037#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 20035#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 20034#L226-4 assume !(write_history_bool_~history_id == 0); 20033#L231-4 assume !(write_history_bool_~history_id == 1); 20030#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 20029#L236-8 assume { :end_inline_write_history_bool } true; 20028#L452 assume ~gate3Failed~0 % 256 != 0; 20027#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 20026#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 20025#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 20024#L486 assume ~VALUE1~0 == ~VALUE2~0; 20005#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 19557#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 20019#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 20010#L211-2 assume { :end_inline_write_history_int8 } true; 20003#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 20004#L294 assume !(~gate1Failed~0 % 256 == 0); 19808#L297 assume ~gate2Failed~0 % 256 == 0;check_~tmp~2 := 1; 19809#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 19962#L171-12 assume read_history_bool_~history_id == 0; 19900#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 19687#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19567#L307 assume !(check_~tmp___3~0 % 256 == 0); 19568#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19575#L151-7 assume read_history_int8_~history_id == 3; 19648#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 19649#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 19651#L346 assume !(check_~tmp___10~0 > -2); 19865#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 19866#L151-9 assume read_history_int8_~history_id == 3; 19636#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 19638#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 19639#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 19708#L366-1 check_#res := 1; 19699#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 19700#L583-72 assume !(assert_~arg % 256 == 0); 19897#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 19781#L558-3 [2018-11-10 08:08:18,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,043 INFO L82 PathProgramCache]: Analyzing trace with hash 352330327, now seen corresponding path program 3 times [2018-11-10 08:08:18,043 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:18,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:18,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:18,089 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:18,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,090 INFO L82 PathProgramCache]: Analyzing trace with hash -659680464, now seen corresponding path program 1 times [2018-11-10 08:08:18,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:18,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,122 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:18,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:08:18,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:08:18,122 INFO L87 Difference]: Start difference. First operand 522 states and 798 transitions. cyclomatic complexity: 281 Second operand 4 states. [2018-11-10 08:08:18,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:18,156 INFO L93 Difference]: Finished difference Result 797 states and 1218 transitions. [2018-11-10 08:08:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:08:18,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 797 states and 1218 transitions. [2018-11-10 08:08:18,161 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 536 [2018-11-10 08:08:18,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 797 states to 761 states and 1164 transitions. [2018-11-10 08:08:18,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 636 [2018-11-10 08:08:18,165 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 636 [2018-11-10 08:08:18,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 761 states and 1164 transitions. [2018-11-10 08:08:18,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:18,166 INFO L705 BuchiCegarLoop]: Abstraction has 761 states and 1164 transitions. [2018-11-10 08:08:18,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states and 1164 transitions. [2018-11-10 08:08:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 488. [2018-11-10 08:08:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-11-10 08:08:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 745 transitions. [2018-11-10 08:08:18,175 INFO L728 BuchiCegarLoop]: Abstraction has 488 states and 745 transitions. [2018-11-10 08:08:18,175 INFO L608 BuchiCegarLoop]: Abstraction has 488 states and 745 transitions. [2018-11-10 08:08:18,175 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-10 08:08:18,175 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 488 states and 745 transitions. [2018-11-10 08:08:18,177 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 268 [2018-11-10 08:08:18,177 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:18,177 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:18,178 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,178 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,179 INFO L793 eck$LassoCheckResult]: Stem: 21122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 20887#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20888#L116-3 assume true; 21249#L116-1 assume !!(add_history_type_~var~0 < 3); 21211#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21070#L171 assume read_history_bool_~history_id == 0; 21071#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 20863#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 21049#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 21050#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 21250#L116-3 assume true; 21251#L116-1 assume !(add_history_type_~var~0 < 3); 21245#L116-4 add_history_type_#res := 1; 21093#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21094#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21198#L116-8 assume true; 21268#L116-6 assume !!(add_history_type_~var~0 < 3); 21195#L117-2 assume !(add_history_type_~history_id == 0); 21196#L123-2 assume !(add_history_type_~history_id == 1); 21293#L129-2 assume !(add_history_type_~history_id == 2); 21281#L135-3 assume !(add_history_type_~history_id == 3); 20907#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 21269#L116-8 assume true; 21270#L116-6 assume !(add_history_type_~var~0 < 3); 21264#L116-9 add_history_type_#res := 1; 21126#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21086#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 21087#L116-13 assume true; 21235#L116-11 assume !!(add_history_type_~var~0 < 3); 21189#L117-4 assume !(add_history_type_~history_id == 0); 21190#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21274#L171-7 assume !(read_history_bool_~history_id == 0); 21161#L181-7 assume read_history_bool_~history_id == 1; 21162#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 20976#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20920#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20901#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 20870#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 20871#L116-18 assume true; 21239#L116-16 assume !!(add_history_type_~var~0 < 3); 21180#L117-6 assume !(add_history_type_~history_id == 0); 21181#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21265#L171-10 assume !(read_history_bool_~history_id == 0); 21149#L181-10 assume read_history_bool_~history_id == 1; 21150#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 20955#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20914#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 20895#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21123#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 21089#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 21090#L558-3 [2018-11-10 08:08:18,179 INFO L795 eck$LassoCheckResult]: Loop: 21090#L558-3 assume true; 21294#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21082#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 21083#L236-2 assume { :end_inline_write_history_bool } true; 21173#L390 assume ~gate1Failed~0 % 256 != 0; 21077#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 21078#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 21091#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21068#L226-2 assume !(write_history_bool_~history_id == 0); 21069#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 21099#L236-5 assume { :end_inline_write_history_bool } true; 21140#L421 assume ~gate2Failed~0 % 256 != 0; 21008#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 20958#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 20930#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 21132#L226-4 assume !(write_history_bool_~history_id == 0); 21124#L231-4 assume !(write_history_bool_~history_id == 1); 21125#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 21133#L236-8 assume { :end_inline_write_history_bool } true; 21167#L452 assume ~gate3Failed~0 % 256 != 0; 21208#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21185#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 21186#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 21203#L486 assume ~VALUE1~0 == ~VALUE2~0; 21205#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 20880#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 21295#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 21243#L211-2 assume { :end_inline_write_history_int8 } true; 21290#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 21291#L294 assume !(~gate1Failed~0 % 256 == 0); 21116#L297 assume ~gate2Failed~0 % 256 == 0;check_~tmp~2 := 1; 21117#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 21257#L171-12 assume read_history_bool_~history_id == 0; 21200#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 21004#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 20891#L307 assume !(check_~tmp___3~0 % 256 == 0); 20892#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 20899#L151-7 assume read_history_int8_~history_id == 3; 20964#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 20965#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 20971#L346 assume !(check_~tmp___10~0 > -2); 21168#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 21169#L151-9 assume read_history_int8_~history_id == 3; 20951#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 20953#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 20959#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 21027#L366-1 check_#res := 1; 21017#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21018#L583-72 assume !(assert_~arg % 256 == 0); 21197#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 21090#L558-3 [2018-11-10 08:08:18,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1805174397, now seen corresponding path program 1 times [2018-11-10 08:08:18,180 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:18,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,219 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:18,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,220 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:18,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,220 INFO L82 PathProgramCache]: Analyzing trace with hash -659680464, now seen corresponding path program 2 times [2018-11-10 08:08:18,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:18,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:18,253 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,253 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:18,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:18,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:18,253 INFO L87 Difference]: Start difference. First operand 488 states and 745 transitions. cyclomatic complexity: 262 Second operand 3 states. [2018-11-10 08:08:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:18,302 INFO L93 Difference]: Finished difference Result 725 states and 1112 transitions. [2018-11-10 08:08:18,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:18,303 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 725 states and 1112 transitions. [2018-11-10 08:08:18,306 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 505 [2018-11-10 08:08:18,309 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 725 states to 725 states and 1112 transitions. [2018-11-10 08:08:18,309 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2018-11-10 08:08:18,310 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 600 [2018-11-10 08:08:18,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 725 states and 1112 transitions. [2018-11-10 08:08:18,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:18,310 INFO L705 BuchiCegarLoop]: Abstraction has 725 states and 1112 transitions. [2018-11-10 08:08:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states and 1112 transitions. [2018-11-10 08:08:18,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 559. [2018-11-10 08:08:18,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-11-10 08:08:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 849 transitions. [2018-11-10 08:08:18,319 INFO L728 BuchiCegarLoop]: Abstraction has 559 states and 849 transitions. [2018-11-10 08:08:18,319 INFO L608 BuchiCegarLoop]: Abstraction has 559 states and 849 transitions. [2018-11-10 08:08:18,319 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-10 08:08:18,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 559 states and 849 transitions. [2018-11-10 08:08:18,320 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-10 08:08:18,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:18,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:18,322 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,322 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,322 INFO L793 eck$LassoCheckResult]: Stem: 22342#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 22107#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22108#L116-3 assume true; 22472#L116-1 assume !!(add_history_type_~var~0 < 3); 22432#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22291#L171 assume read_history_bool_~history_id == 0; 22292#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 22083#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22270#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22271#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 22473#L116-3 assume true; 22474#L116-1 assume !(add_history_type_~var~0 < 3); 22469#L116-4 add_history_type_#res := 1; 22314#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22315#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22418#L116-8 assume true; 22491#L116-6 assume !!(add_history_type_~var~0 < 3); 22415#L117-2 assume !(add_history_type_~history_id == 0); 22416#L123-2 assume !(add_history_type_~history_id == 1); 22520#L129-2 assume !(add_history_type_~history_id == 2); 22506#L135-3 assume !(add_history_type_~history_id == 3); 22127#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 22492#L116-8 assume true; 22493#L116-6 assume !(add_history_type_~var~0 < 3); 22487#L116-9 add_history_type_#res := 1; 22346#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22308#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22309#L116-13 assume true; 22458#L116-11 assume !!(add_history_type_~var~0 < 3); 22409#L117-4 assume !(add_history_type_~history_id == 0); 22410#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22498#L171-7 assume !(read_history_bool_~history_id == 0); 22381#L181-7 assume read_history_bool_~history_id == 1; 22382#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 22197#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22140#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22121#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22090#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 22091#L116-18 assume true; 22464#L116-16 assume !!(add_history_type_~var~0 < 3); 22400#L117-6 assume !(add_history_type_~history_id == 0); 22401#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22488#L171-10 assume !(read_history_bool_~history_id == 0); 22369#L181-10 assume read_history_bool_~history_id == 1; 22370#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 22172#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22131#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22112#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22343#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 22310#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 22311#L558-3 [2018-11-10 08:08:18,322 INFO L795 eck$LassoCheckResult]: Loop: 22311#L558-3 assume true; 22521#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22301#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 22302#L236-2 assume { :end_inline_write_history_bool } true; 22393#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 22358#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 22297#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 22307#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 22470#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 22478#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22594#L226-2 assume !(write_history_bool_~history_id == 0); 22592#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 22589#L236-5 assume { :end_inline_write_history_bool } true; 22587#L421 assume ~gate2Failed~0 % 256 != 0; 22586#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 22585#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 22584#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 22583#L226-4 assume !(write_history_bool_~history_id == 0); 22582#L231-4 assume !(write_history_bool_~history_id == 1); 22579#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 22576#L236-8 assume { :end_inline_write_history_bool } true; 22573#L452 assume ~gate3Failed~0 % 256 != 0; 22571#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 22570#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 22568#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 22565#L486 assume ~VALUE1~0 == ~VALUE2~0; 22563#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 22544#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 22539#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 22532#L211-2 assume { :end_inline_write_history_int8 } true; 22529#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 22526#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 22515#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 22480#L171-12 assume read_history_bool_~history_id == 0; 22420#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 22226#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22116#L307 assume !(check_~tmp___3~0 % 256 == 0); 22117#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22119#L151-7 assume read_history_int8_~history_id == 3; 22185#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 22186#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22192#L346 assume !(check_~tmp___10~0 > -2); 22388#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 22389#L151-9 assume read_history_int8_~history_id == 3; 22177#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 22179#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22180#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22248#L366-1 check_#res := 1; 22238#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22239#L583-72 assume !(assert_~arg % 256 == 0); 22417#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 22311#L558-3 [2018-11-10 08:08:18,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1805174397, now seen corresponding path program 2 times [2018-11-10 08:08:18,323 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:18,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-10 08:08:18,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,365 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:18,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1276375210, now seen corresponding path program 1 times [2018-11-10 08:08:18,365 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:18,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:18,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,389 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:18,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:18,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:18,389 INFO L87 Difference]: Start difference. First operand 559 states and 849 transitions. cyclomatic complexity: 295 Second operand 3 states. [2018-11-10 08:08:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:18,428 INFO L93 Difference]: Finished difference Result 903 states and 1362 transitions. [2018-11-10 08:08:18,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:18,429 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 903 states and 1362 transitions. [2018-11-10 08:08:18,433 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 678 [2018-11-10 08:08:18,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 903 states to 903 states and 1362 transitions. [2018-11-10 08:08:18,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 788 [2018-11-10 08:08:18,437 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 788 [2018-11-10 08:08:18,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 903 states and 1362 transitions. [2018-11-10 08:08:18,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:18,438 INFO L705 BuchiCegarLoop]: Abstraction has 903 states and 1362 transitions. [2018-11-10 08:08:18,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states and 1362 transitions. [2018-11-10 08:08:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 551. [2018-11-10 08:08:18,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-10 08:08:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 831 transitions. [2018-11-10 08:08:18,447 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 831 transitions. [2018-11-10 08:08:18,448 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 831 transitions. [2018-11-10 08:08:18,448 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-10 08:08:18,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 831 transitions. [2018-11-10 08:08:18,449 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-10 08:08:18,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:18,449 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:18,450 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,451 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,451 INFO L793 eck$LassoCheckResult]: Stem: 23800#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 23576#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23577#L116-3 assume true; 23926#L116-1 assume !!(add_history_type_~var~0 < 3); 23890#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23752#L171 assume read_history_bool_~history_id == 0; 23753#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 23549#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 23735#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 23736#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 23927#L116-3 assume true; 23928#L116-1 assume !(add_history_type_~var~0 < 3); 23923#L116-4 add_history_type_#res := 1; 23772#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 23773#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23877#L116-8 assume true; 23945#L116-6 assume !!(add_history_type_~var~0 < 3); 23874#L117-2 assume !(add_history_type_~history_id == 0); 23875#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23929#L171-4 assume !(read_history_bool_~history_id == 0); 23810#L181-4 assume read_history_bool_~history_id == 1; 23811#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 23715#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23611#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 23612#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 23946#L116-8 assume true; 23947#L116-6 assume !(add_history_type_~var~0 < 3); 23941#L116-9 add_history_type_#res := 1; 23804#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 23766#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23767#L116-13 assume true; 23980#L116-11 assume !!(add_history_type_~var~0 < 3); 23866#L117-4 assume !(add_history_type_~history_id == 0); 23867#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23951#L171-7 assume !(read_history_bool_~history_id == 0); 23836#L181-7 assume read_history_bool_~history_id == 1; 23837#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 23661#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23605#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23589#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23559#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 23560#L116-18 assume true; 23979#L116-16 assume !!(add_history_type_~var~0 < 3); 23855#L117-6 assume !(add_history_type_~history_id == 0); 23856#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23942#L171-10 assume !(read_history_bool_~history_id == 0); 23824#L181-10 assume read_history_bool_~history_id == 1; 23825#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 23639#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23598#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23581#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 23801#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 23769#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 23770#L558-3 [2018-11-10 08:08:18,451 INFO L795 eck$LassoCheckResult]: Loop: 23770#L558-3 assume true; 23970#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23763#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 23764#L236-2 assume { :end_inline_write_history_bool } true; 23848#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 23813#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 23758#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 23768#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 23925#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 23932#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 24064#L226-2 assume !(write_history_bool_~history_id == 0); 24062#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 24059#L236-5 assume { :end_inline_write_history_bool } true; 24058#L421 assume ~gate2Failed~0 % 256 != 0; 23689#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 23642#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 23643#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 23807#L226-4 assume !(write_history_bool_~history_id == 0); 23802#L231-4 assume !(write_history_bool_~history_id == 1); 23803#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 23808#L236-8 assume { :end_inline_write_history_bool } true; 23842#L452 assume ~gate3Failed~0 % 256 != 0; 23885#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 23862#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 23863#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 23882#L486 assume ~VALUE1~0 == ~VALUE2~0; 23884#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 23575#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 23972#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 23922#L211-2 assume { :end_inline_write_history_int8 } true; 23971#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 23981#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 23965#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 23934#L171-12 assume read_history_bool_~history_id == 0; 23879#L172-12 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 23691#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23585#L307 assume !(check_~tmp___3~0 % 256 == 0); 23586#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 23593#L151-7 assume read_history_int8_~history_id == 3; 23656#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 23657#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 23659#L346 assume !(check_~tmp___10~0 > -2); 23843#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 23844#L151-9 assume read_history_int8_~history_id == 3; 23644#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 23646#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 23647#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 23713#L366-1 check_#res := 1; 23703#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 23704#L583-72 assume !(assert_~arg % 256 == 0); 23876#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 23770#L558-3 [2018-11-10 08:08:18,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 1 times [2018-11-10 08:08:18,451 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:18,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:08:18,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,489 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:18,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1276375210, now seen corresponding path program 2 times [2018-11-10 08:08:18,490 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,524 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:18,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:18,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:18,524 INFO L87 Difference]: Start difference. First operand 551 states and 831 transitions. cyclomatic complexity: 287 Second operand 3 states. [2018-11-10 08:08:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:18,662 INFO L93 Difference]: Finished difference Result 861 states and 1241 transitions. [2018-11-10 08:08:18,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:18,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 861 states and 1241 transitions. [2018-11-10 08:08:18,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-10 08:08:18,666 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 861 states to 861 states and 1241 transitions. [2018-11-10 08:08:18,667 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 687 [2018-11-10 08:08:18,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 687 [2018-11-10 08:08:18,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 861 states and 1241 transitions. [2018-11-10 08:08:18,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:18,669 INFO L705 BuchiCegarLoop]: Abstraction has 861 states and 1241 transitions. [2018-11-10 08:08:18,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states and 1241 transitions. [2018-11-10 08:08:18,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 551. [2018-11-10 08:08:18,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-10 08:08:18,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 803 transitions. [2018-11-10 08:08:18,679 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 803 transitions. [2018-11-10 08:08:18,679 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 803 transitions. [2018-11-10 08:08:18,679 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-10 08:08:18,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 803 transitions. [2018-11-10 08:08:18,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-10 08:08:18,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:18,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:18,682 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,682 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,683 INFO L793 eck$LassoCheckResult]: Stem: 25219#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 24995#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24996#L116-3 assume true; 25347#L116-1 assume !!(add_history_type_~var~0 < 3); 25310#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25171#L171 assume read_history_bool_~history_id == 0; 25172#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 24971#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 25154#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 25155#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 25348#L116-3 assume true; 25349#L116-1 assume !(add_history_type_~var~0 < 3); 25345#L116-4 add_history_type_#res := 1; 25192#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 25193#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25297#L116-8 assume true; 25366#L116-6 assume !!(add_history_type_~var~0 < 3); 25294#L117-2 assume !(add_history_type_~history_id == 0); 25295#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25350#L171-4 assume !(read_history_bool_~history_id == 0); 25229#L181-4 assume read_history_bool_~history_id == 1; 25230#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 25136#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25030#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25031#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 25367#L116-8 assume true; 25368#L116-6 assume !(add_history_type_~var~0 < 3); 25362#L116-9 add_history_type_#res := 1; 25223#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 25185#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 25186#L116-13 assume true; 25401#L116-11 assume !!(add_history_type_~var~0 < 3); 25286#L117-4 assume !(add_history_type_~history_id == 0); 25287#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25373#L171-7 assume !(read_history_bool_~history_id == 0); 25255#L181-7 assume read_history_bool_~history_id == 1; 25256#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 25083#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25024#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25009#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 24978#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 24979#L116-18 assume true; 25337#L116-16 assume !!(add_history_type_~var~0 < 3); 25274#L117-6 assume !(add_history_type_~history_id == 0); 25275#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25363#L171-10 assume !(read_history_bool_~history_id == 0); 25243#L181-10 assume read_history_bool_~history_id == 1; 25244#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 25061#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25017#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25003#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 25220#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 25188#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 25189#L558-3 [2018-11-10 08:08:18,683 INFO L795 eck$LassoCheckResult]: Loop: 25189#L558-3 assume true; 25393#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25182#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 25183#L236-2 assume { :end_inline_write_history_bool } true; 25267#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 25232#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 25177#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 25187#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 25346#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 25280#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25169#L226-2 assume !(write_history_bool_~history_id == 0); 25170#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 25197#L236-5 assume { :end_inline_write_history_bool } true; 25234#L421 assume ~gate2Failed~0 % 256 != 0; 25113#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25064#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 25065#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 25226#L226-4 assume !(write_history_bool_~history_id == 0); 25221#L231-4 assume !(write_history_bool_~history_id == 1); 25222#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 25227#L236-8 assume { :end_inline_write_history_bool } true; 25261#L452 assume ~gate3Failed~0 % 256 != 0; 25305#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 25282#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 25283#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 25302#L486 assume ~VALUE1~0 == ~VALUE2~0; 25304#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 24988#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 25395#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 25342#L211-2 assume { :end_inline_write_history_int8 } true; 25388#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 25389#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 25387#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 25355#L171-12 assume read_history_bool_~history_id == 0; 25299#L172-12 assume !(read_history_bool_~historyIndex == 0); 25271#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 25109#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 24999#L307 assume !(check_~tmp___3~0 % 256 == 0); 25000#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25007#L151-7 assume read_history_int8_~history_id == 3; 25071#L152-7 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 25072#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25078#L346 assume !(check_~tmp___10~0 > -2); 25262#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 25263#L151-9 assume read_history_int8_~history_id == 3; 25057#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 25059#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25066#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 25132#L366-1 check_#res := 1; 25122#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25123#L583-72 assume !(assert_~arg % 256 == 0); 25296#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 25189#L558-3 [2018-11-10 08:08:18,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 2 times [2018-11-10 08:08:18,683 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:18,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:08:18,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:18,735 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:18,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,735 INFO L82 PathProgramCache]: Analyzing trace with hash 204498799, now seen corresponding path program 1 times [2018-11-10 08:08:18,735 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,736 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:18,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:18,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:18,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:18,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:18,784 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:18,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:08:18,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:08:18,784 INFO L87 Difference]: Start difference. First operand 551 states and 803 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-10 08:08:18,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:18,970 INFO L93 Difference]: Finished difference Result 1562 states and 2248 transitions. [2018-11-10 08:08:18,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:08:18,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1562 states and 2248 transitions. [2018-11-10 08:08:18,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 631 [2018-11-10 08:08:18,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1562 states to 1562 states and 2248 transitions. [2018-11-10 08:08:18,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1280 [2018-11-10 08:08:18,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1280 [2018-11-10 08:08:18,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1562 states and 2248 transitions. [2018-11-10 08:08:18,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:18,980 INFO L705 BuchiCegarLoop]: Abstraction has 1562 states and 2248 transitions. [2018-11-10 08:08:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states and 2248 transitions. [2018-11-10 08:08:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 551. [2018-11-10 08:08:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-11-10 08:08:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 802 transitions. [2018-11-10 08:08:18,989 INFO L728 BuchiCegarLoop]: Abstraction has 551 states and 802 transitions. [2018-11-10 08:08:18,989 INFO L608 BuchiCegarLoop]: Abstraction has 551 states and 802 transitions. [2018-11-10 08:08:18,989 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-10 08:08:18,989 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 551 states and 802 transitions. [2018-11-10 08:08:18,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 339 [2018-11-10 08:08:18,991 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:18,991 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:18,992 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,992 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:18,992 INFO L793 eck$LassoCheckResult]: Stem: 27343#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 27119#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27120#L116-3 assume true; 27470#L116-1 assume !!(add_history_type_~var~0 < 3); 27433#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27295#L171 assume read_history_bool_~history_id == 0; 27296#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 27092#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 27278#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 27279#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 27471#L116-3 assume true; 27472#L116-1 assume !(add_history_type_~var~0 < 3); 27467#L116-4 add_history_type_#res := 1; 27315#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 27316#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27420#L116-8 assume true; 27489#L116-6 assume !!(add_history_type_~var~0 < 3); 27417#L117-2 assume !(add_history_type_~history_id == 0); 27418#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27473#L171-4 assume !(read_history_bool_~history_id == 0); 27353#L181-4 assume read_history_bool_~history_id == 1; 27354#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 27258#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27154#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 27155#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 27490#L116-8 assume true; 27491#L116-6 assume !(add_history_type_~var~0 < 3); 27485#L116-9 add_history_type_#res := 1; 27347#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 27309#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27310#L116-13 assume true; 27521#L116-11 assume !!(add_history_type_~var~0 < 3); 27409#L117-4 assume !(add_history_type_~history_id == 0); 27410#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27495#L171-7 assume !(read_history_bool_~history_id == 0); 27379#L181-7 assume read_history_bool_~history_id == 1; 27380#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 27204#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27148#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27132#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 27102#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 27103#L116-18 assume true; 27460#L116-16 assume !!(add_history_type_~var~0 < 3); 27398#L117-6 assume !(add_history_type_~history_id == 0); 27399#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27486#L171-10 assume !(read_history_bool_~history_id == 0); 27367#L181-10 assume read_history_bool_~history_id == 1; 27368#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 27182#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27141#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27124#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 27344#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 27312#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 27313#L558-3 [2018-11-10 08:08:18,992 INFO L795 eck$LassoCheckResult]: Loop: 27313#L558-3 assume true; 27517#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27306#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 27307#L236-2 assume { :end_inline_write_history_bool } true; 27391#L390 assume ~gate1Failed~0 % 256 != 0; 27302#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 27303#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 27314#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27293#L226-2 assume !(write_history_bool_~history_id == 0); 27294#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 27319#L236-5 assume { :end_inline_write_history_bool } true; 27358#L421 assume ~gate2Failed~0 % 256 != 0; 27515#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27619#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 27617#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 27615#L226-4 assume !(write_history_bool_~history_id == 0); 27614#L231-4 assume !(write_history_bool_~history_id == 1); 27611#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 27609#L236-8 assume { :end_inline_write_history_bool } true; 27607#L452 assume ~gate3Failed~0 % 256 != 0; 27606#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27601#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 27598#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 27596#L486 assume ~VALUE1~0 == ~VALUE2~0; 27569#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 27561#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 27520#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 27466#L211-2 assume { :end_inline_write_history_int8 } true; 27512#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 27513#L294 assume !(~gate1Failed~0 % 256 == 0); 27338#L297 assume !(~gate2Failed~0 % 256 == 0); 27339#L300 assume ~gate3Failed~0 % 256 == 0;check_~tmp~2 := 1; 27511#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 27478#L171-12 assume read_history_bool_~history_id == 0; 27422#L172-12 assume !(read_history_bool_~historyIndex == 0); 27395#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 27234#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 27128#L307 assume !(check_~tmp___3~0 % 256 == 0); 27129#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 27136#L151-7 assume !(read_history_int8_~history_id == 3);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 27438#L583-54 assume !(assert_~arg % 256 == 0); 27439#L578-27 assume { :end_inline_assert } true;read_history_int8_#res := -2; 27201#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 27202#L346 assume !(check_~tmp___10~0 > -2); 27386#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 27387#L151-9 assume read_history_int8_~history_id == 3; 27187#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 27189#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 27190#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 27256#L366-1 check_#res := 1; 27246#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 27247#L583-72 assume !(assert_~arg % 256 == 0); 27419#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 27313#L558-3 [2018-11-10 08:08:18,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 3 times [2018-11-10 08:08:18,993 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:18,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:18,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:18,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:19,034 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:08:19,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:19,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:19,034 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:19,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:19,035 INFO L82 PathProgramCache]: Analyzing trace with hash -783601893, now seen corresponding path program 1 times [2018-11-10 08:08:19,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:19,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:19,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:19,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:19,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:19,068 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:19,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:19,069 INFO L87 Difference]: Start difference. First operand 551 states and 802 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-11-10 08:08:19,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:19,091 INFO L93 Difference]: Finished difference Result 830 states and 1206 transitions. [2018-11-10 08:08:19,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:19,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 830 states and 1206 transitions. [2018-11-10 08:08:19,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 618 [2018-11-10 08:08:19,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 830 states to 830 states and 1206 transitions. [2018-11-10 08:08:19,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 715 [2018-11-10 08:08:19,098 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 715 [2018-11-10 08:08:19,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 830 states and 1206 transitions. [2018-11-10 08:08:19,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:19,099 INFO L705 BuchiCegarLoop]: Abstraction has 830 states and 1206 transitions. [2018-11-10 08:08:19,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states and 1206 transitions. [2018-11-10 08:08:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 630. [2018-11-10 08:08:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-11-10 08:08:19,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 924 transitions. [2018-11-10 08:08:19,108 INFO L728 BuchiCegarLoop]: Abstraction has 630 states and 924 transitions. [2018-11-10 08:08:19,108 INFO L608 BuchiCegarLoop]: Abstraction has 630 states and 924 transitions. [2018-11-10 08:08:19,108 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-11-10 08:08:19,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 630 states and 924 transitions. [2018-11-10 08:08:19,110 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 418 [2018-11-10 08:08:19,110 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:19,110 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:19,111 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:19,111 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:19,112 INFO L793 eck$LassoCheckResult]: Stem: 28731#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 28507#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28508#L116-3 assume true; 28860#L116-1 assume !!(add_history_type_~var~0 < 3); 28823#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28683#L171 assume read_history_bool_~history_id == 0; 28684#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 28480#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 28666#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 28667#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 28861#L116-3 assume true; 28862#L116-1 assume !(add_history_type_~var~0 < 3); 28857#L116-4 add_history_type_#res := 1; 28703#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 28704#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28810#L116-8 assume true; 28878#L116-6 assume !!(add_history_type_~var~0 < 3); 28807#L117-2 assume !(add_history_type_~history_id == 0); 28808#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28863#L171-4 assume !(read_history_bool_~history_id == 0); 28742#L181-4 assume read_history_bool_~history_id == 1; 28743#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 28646#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28542#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 28543#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 28879#L116-8 assume true; 28880#L116-6 assume !(add_history_type_~var~0 < 3); 28874#L116-9 add_history_type_#res := 1; 28735#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 28697#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28698#L116-13 assume true; 28912#L116-11 assume !!(add_history_type_~var~0 < 3); 28799#L117-4 assume !(add_history_type_~history_id == 0); 28800#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28884#L171-7 assume !(read_history_bool_~history_id == 0); 28768#L181-7 assume read_history_bool_~history_id == 1; 28769#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 28592#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28536#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 28520#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 28490#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 28491#L116-18 assume true; 28850#L116-16 assume !!(add_history_type_~var~0 < 3); 28787#L117-6 assume !(add_history_type_~history_id == 0); 28788#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28875#L171-10 assume !(read_history_bool_~history_id == 0); 28756#L181-10 assume read_history_bool_~history_id == 1; 28757#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 28570#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28529#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 28512#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 28732#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 28700#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 28701#L558-3 [2018-11-10 08:08:19,112 INFO L795 eck$LassoCheckResult]: Loop: 28701#L558-3 assume true; 28903#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 28694#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 28695#L236-2 assume { :end_inline_write_history_bool } true; 28780#L390 assume ~gate1Failed~0 % 256 != 0; 28690#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 28691#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 28702#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29107#L226-2 assume !(write_history_bool_~history_id == 0); 29105#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 29102#L236-5 assume { :end_inline_write_history_bool } true; 29100#L421 assume ~gate2Failed~0 % 256 != 0; 29101#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 29108#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 28738#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 28739#L226-4 assume !(write_history_bool_~history_id == 0); 28733#L231-4 assume !(write_history_bool_~history_id == 1); 28734#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 28740#L236-8 assume { :end_inline_write_history_bool } true; 28774#L452 assume ~gate3Failed~0 % 256 != 0; 28818#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 28795#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 28796#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 28815#L486 assume ~VALUE1~0 == ~VALUE2~0; 28817#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 28506#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 28904#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 28856#L211-2 assume { :end_inline_write_history_int8 } true; 28899#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 28900#L294 assume !(~gate1Failed~0 % 256 == 0); 28726#L297 assume !(~gate2Failed~0 % 256 == 0); 28727#L300 assume !(~gate3Failed~0 % 256 == 0);check_~tmp~2 := 0; 28898#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 28867#L171-12 assume read_history_bool_~history_id == 0; 28812#L172-12 assume !(read_history_bool_~historyIndex == 0); 28784#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 28622#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 28516#L307 assume !(check_~tmp___3~0 % 256 == 0); 28517#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 28524#L151-7 assume read_history_int8_~history_id == 3; 28587#L152-7 assume !(read_history_int8_~historyIndex == 0); 28588#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 28589#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 28590#L346 assume !(check_~tmp___10~0 > -2); 28775#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 28776#L151-9 assume read_history_int8_~history_id == 3; 28575#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 28577#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 28578#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 28644#L366-1 check_#res := 1; 28634#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 28635#L583-72 assume !(assert_~arg % 256 == 0); 28809#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 28701#L558-3 [2018-11-10 08:08:19,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:19,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 4 times [2018-11-10 08:08:19,112 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:19,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:19,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:19,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:08:19,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:19,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:19,162 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:19,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:19,163 INFO L82 PathProgramCache]: Analyzing trace with hash -658411516, now seen corresponding path program 1 times [2018-11-10 08:08:19,163 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:19,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:19,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:19,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:19,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:19,195 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:08:19,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:19,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:19,196 INFO L87 Difference]: Start difference. First operand 630 states and 924 transitions. cyclomatic complexity: 301 Second operand 3 states. [2018-11-10 08:08:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:19,219 INFO L93 Difference]: Finished difference Result 631 states and 924 transitions. [2018-11-10 08:08:19,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:19,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 631 states and 924 transitions. [2018-11-10 08:08:19,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-10 08:08:19,225 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 631 states to 607 states and 887 transitions. [2018-11-10 08:08:19,225 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 492 [2018-11-10 08:08:19,225 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 492 [2018-11-10 08:08:19,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 607 states and 887 transitions. [2018-11-10 08:08:19,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:19,225 INFO L705 BuchiCegarLoop]: Abstraction has 607 states and 887 transitions. [2018-11-10 08:08:19,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states and 887 transitions. [2018-11-10 08:08:19,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 607. [2018-11-10 08:08:19,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-11-10 08:08:19,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 887 transitions. [2018-11-10 08:08:19,234 INFO L728 BuchiCegarLoop]: Abstraction has 607 states and 887 transitions. [2018-11-10 08:08:19,234 INFO L608 BuchiCegarLoop]: Abstraction has 607 states and 887 transitions. [2018-11-10 08:08:19,234 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-11-10 08:08:19,234 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 887 transitions. [2018-11-10 08:08:19,235 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-10 08:08:19,236 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:19,236 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:19,237 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:19,237 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:19,241 INFO L793 eck$LassoCheckResult]: Stem: 29999#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 29775#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29776#L116-3 assume true; 30126#L116-1 assume !!(add_history_type_~var~0 < 3); 30090#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 29951#L171 assume read_history_bool_~history_id == 0; 29952#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 29751#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 29934#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 29935#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 30127#L116-3 assume true; 30128#L116-1 assume !(add_history_type_~var~0 < 3); 30123#L116-4 add_history_type_#res := 1; 29972#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 29973#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 30077#L116-8 assume true; 30144#L116-6 assume !!(add_history_type_~var~0 < 3); 30074#L117-2 assume !(add_history_type_~history_id == 0); 30075#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30129#L171-4 assume !(read_history_bool_~history_id == 0); 30009#L181-4 assume read_history_bool_~history_id == 1; 30010#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 29914#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29810#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 29811#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 30145#L116-8 assume true; 30146#L116-6 assume !(add_history_type_~var~0 < 3); 30140#L116-9 add_history_type_#res := 1; 30003#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 29965#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29966#L116-13 assume true; 30107#L116-11 assume !!(add_history_type_~var~0 < 3); 30066#L117-4 assume !(add_history_type_~history_id == 0); 30067#L123-4 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30150#L171-7 assume !(read_history_bool_~history_id == 0); 30035#L181-7 assume read_history_bool_~history_id == 1; 30036#L182-7 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 29863#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29804#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29788#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 29758#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 29759#L116-18 assume true; 30116#L116-16 assume !!(add_history_type_~var~0 < 3); 30054#L117-6 assume !(add_history_type_~history_id == 0); 30055#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30141#L171-10 assume !(read_history_bool_~history_id == 0); 30023#L181-10 assume read_history_bool_~history_id == 1; 30024#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 29838#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29797#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29780#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 30000#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 29968#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 29969#L558-3 [2018-11-10 08:08:19,241 INFO L795 eck$LassoCheckResult]: Loop: 29969#L558-3 assume true; 30172#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29962#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 29963#L236-2 assume { :end_inline_write_history_bool } true; 30047#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 30012#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 29957#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 29967#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 30125#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 30060#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 29949#L226-2 assume !(write_history_bool_~history_id == 0); 29950#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 29975#L236-5 assume { :end_inline_write_history_bool } true; 30014#L421 assume ~gate2Failed~0 % 256 != 0; 29888#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 29841#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 29842#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 30256#L226-4 assume !(write_history_bool_~history_id == 0); 30255#L231-4 assume !(write_history_bool_~history_id == 1); 30251#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 30250#L236-8 assume { :end_inline_write_history_bool } true; 30249#L452 assume ~gate3Failed~0 % 256 != 0; 30085#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 30062#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 30063#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 30082#L486 assume ~VALUE1~0 == ~VALUE2~0; 30084#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 29774#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 30174#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 30319#L211-2 assume { :end_inline_write_history_int8 } true; 30166#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 30167#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 30165#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 30133#L171-12 assume read_history_bool_~history_id == 0; 30079#L172-12 assume !(read_history_bool_~historyIndex == 0); 30051#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 29890#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 29784#L307 assume !(check_~tmp___3~0 % 256 == 0); 29785#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 29792#L151-7 assume read_history_int8_~history_id == 3; 29855#L152-7 assume !(read_history_int8_~historyIndex == 0); 29856#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 29857#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 29858#L346 assume !(check_~tmp___10~0 > -2); 30042#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 30043#L151-9 assume read_history_int8_~history_id == 3; 29843#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 29845#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 29846#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 29911#L366-1 check_#res := 1; 29902#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 29903#L583-72 assume !(assert_~arg % 256 == 0); 30076#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 29969#L558-3 [2018-11-10 08:08:19,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:19,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1259488747, now seen corresponding path program 5 times [2018-11-10 08:08:19,241 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:19,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:19,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:19,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:08:19,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:19,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:08:19,280 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:19,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash 459587620, now seen corresponding path program 1 times [2018-11-10 08:08:19,280 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:19,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,281 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:08:19,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:19,936 WARN L179 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 216 [2018-11-10 08:08:21,750 WARN L179 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 187 DAG size of output: 168 [2018-11-10 08:08:21,755 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:21,755 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:21,755 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:21,755 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:21,755 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:21,755 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:21,756 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:21,756 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:21,756 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration17_Loop [2018-11-10 08:08:21,756 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:21,756 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:21,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,902 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-10 08:08:21,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:21,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,007 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:22,323 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-10 08:08:24,908 WARN L179 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-10 08:08:25,010 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:25,010 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:25,015 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:25,015 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:25,017 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:25,017 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:25,034 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:25,034 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:25,036 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:25,036 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:25,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:25,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:25,057 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:25,057 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:25,073 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:25,074 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:25,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:25,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:37,163 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 08:08:37,167 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:37,167 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:37,167 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:37,167 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:37,167 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:37,167 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:37,167 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:37,167 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:37,167 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration17_Loop [2018-11-10 08:08:37,167 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:37,167 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:37,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,323 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-11-10 08:08:37,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,330 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:37,602 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-11-10 08:08:40,175 WARN L179 SmtUtils]: Spent 2.41 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-11-10 08:08:40,283 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:40,283 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:08:40,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,285 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,287 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,289 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,291 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,292 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:08:40,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:08:40,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,294 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:08:40,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:08:40,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:08:40,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:08:40,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:08:40,295 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-10 08:08:40,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:08:40,311 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 08:08:40,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:08:40,519 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:08:40,738 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:08:40,739 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 08:08:40,739 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:08:40,739 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:08:40,739 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:08:40,740 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-10 08:08:40,740 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:08:40,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:40,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:40,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:40,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:08:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:08:41,095 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 14 loop predicates [2018-11-10 08:08:41,095 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 607 states and 887 transitions. cyclomatic complexity: 287 Second operand 16 states. [2018-11-10 08:08:41,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 607 states and 887 transitions. cyclomatic complexity: 287. Second operand 16 states. Result 4524 states and 6218 transitions. Complement of second has 37 states. [2018-11-10 08:08:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-10 08:08:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 08:08:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1701 transitions. [2018-11-10 08:08:41,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1701 transitions. Stem has 53 letters. Loop has 53 letters. [2018-11-10 08:08:41,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:41,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1701 transitions. Stem has 106 letters. Loop has 53 letters. [2018-11-10 08:08:41,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:41,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1701 transitions. Stem has 53 letters. Loop has 106 letters. [2018-11-10 08:08:41,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:08:41,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4524 states and 6218 transitions. [2018-11-10 08:08:41,966 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-10 08:08:41,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4524 states to 2788 states and 3895 transitions. [2018-11-10 08:08:41,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2449 [2018-11-10 08:08:41,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2451 [2018-11-10 08:08:41,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2788 states and 3895 transitions. [2018-11-10 08:08:41,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:41,981 INFO L705 BuchiCegarLoop]: Abstraction has 2788 states and 3895 transitions. [2018-11-10 08:08:41,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states and 3895 transitions. [2018-11-10 08:08:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 1023. [2018-11-10 08:08:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1023 states. [2018-11-10 08:08:42,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1469 transitions. [2018-11-10 08:08:42,005 INFO L728 BuchiCegarLoop]: Abstraction has 1023 states and 1469 transitions. [2018-11-10 08:08:42,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:08:42,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:08:42,006 INFO L87 Difference]: Start difference. First operand 1023 states and 1469 transitions. Second operand 3 states. [2018-11-10 08:08:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:08:42,044 INFO L93 Difference]: Finished difference Result 1805 states and 2570 transitions. [2018-11-10 08:08:42,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:08:42,047 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1805 states and 2570 transitions. [2018-11-10 08:08:42,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 790 [2018-11-10 08:08:42,060 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1805 states to 1805 states and 2570 transitions. [2018-11-10 08:08:42,061 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1292 [2018-11-10 08:08:42,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1292 [2018-11-10 08:08:42,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1805 states and 2570 transitions. [2018-11-10 08:08:42,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:08:42,063 INFO L705 BuchiCegarLoop]: Abstraction has 1805 states and 2570 transitions. [2018-11-10 08:08:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1805 states and 2570 transitions. [2018-11-10 08:08:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1805 to 987. [2018-11-10 08:08:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2018-11-10 08:08:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1407 transitions. [2018-11-10 08:08:42,080 INFO L728 BuchiCegarLoop]: Abstraction has 987 states and 1407 transitions. [2018-11-10 08:08:42,080 INFO L608 BuchiCegarLoop]: Abstraction has 987 states and 1407 transitions. [2018-11-10 08:08:42,080 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-11-10 08:08:42,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 987 states and 1407 transitions. [2018-11-10 08:08:42,083 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 395 [2018-11-10 08:08:42,083 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:08:42,083 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:08:42,084 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:42,084 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:08:42,085 INFO L793 eck$LassoCheckResult]: Stem: 38428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 38156#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38157#L116-3 assume true; 38602#L116-1 assume !!(add_history_type_~var~0 < 3); 38544#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38361#L171 assume read_history_bool_~history_id == 0; 38362#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 38120#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 38344#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 38345#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 38603#L116-3 assume true; 38604#L116-1 assume !(add_history_type_~var~0 < 3); 38597#L116-4 add_history_type_#res := 1; 38385#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 38386#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38521#L116-8 assume true; 38627#L116-6 assume !!(add_history_type_~var~0 < 3); 38517#L117-2 assume !(add_history_type_~history_id == 0); 38518#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38605#L171-4 assume !(read_history_bool_~history_id == 0); 38443#L181-4 assume read_history_bool_~history_id == 1; 38444#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 38333#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38199#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 38200#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 38628#L116-8 assume true; 38629#L116-6 assume !(add_history_type_~var~0 < 3); 38622#L116-9 add_history_type_#res := 1; 38434#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 38376#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38377#L116-13 assume true; 38569#L116-11 assume !!(add_history_type_~var~0 < 3); 38511#L117-4 assume !(add_history_type_~history_id == 0); 38512#L123-4 assume !(add_history_type_~history_id == 1); 38650#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38632#L171-8 assume !(read_history_bool_~history_id == 0); 38467#L181-8 assume read_history_bool_~history_id == 1; 38468#L182-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 38248#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 38175#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38176#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 38130#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 38131#L116-18 assume true; 38686#L116-16 assume !!(add_history_type_~var~0 < 3); 38494#L117-6 assume !(add_history_type_~history_id == 0); 38495#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38625#L171-10 assume !(read_history_bool_~history_id == 0); 38461#L181-10 assume read_history_bool_~history_id == 1; 38462#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 38229#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 38185#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 38169#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 38429#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 38381#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 38382#L558-3 assume true; 38668#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38669#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38847#L236-2 assume { :end_inline_write_history_bool } true; 38845#L390 assume ~gate1Failed~0 % 256 != 0; 38368#L391 [2018-11-10 08:08:42,085 INFO L795 eck$LassoCheckResult]: Loop: 38368#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 38369#L391-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite28 % 256 <= 127 then gate1_each_pals_period_#t~ite28 % 256 else gate1_each_pals_period_#t~ite28 % 256 - 256);havoc gate1_each_pals_period_#t~ite28; 38383#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 39013#L226-2 assume !(write_history_bool_~history_id == 0); 39005#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 39001#L236-5 assume { :end_inline_write_history_bool } true; 38996#L421 assume !(~gate2Failed~0 % 256 != 0);gate2_each_pals_period_~tmp~4 := gate2_each_pals_period_#t~nondet33;havoc gate2_each_pals_period_#t~nondet33;gate2_each_pals_period_~next_state~1 := gate2_each_pals_period_~tmp~4; 38994#L427 assume gate2_each_pals_period_~next_state~1 == 0;gate2_each_pals_period_~tmp___0~4 := 1; 38990#L433-2 assume (if gate2_each_pals_period_~tmp___0~4 == 0 then 0 else 1) % 256 != 0; 38988#L439 assume !(gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite34 := ~g2v_new~0; 38986#L439-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite34 % 256 <= 127 then gate2_each_pals_period_#t~ite34 % 256 else gate2_each_pals_period_#t~ite34 % 256 - 256);havoc gate2_each_pals_period_#t~ite34; 38984#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38982#L226-4 assume !(write_history_bool_~history_id == 0); 38980#L231-4 assume !(write_history_bool_~history_id == 1); 38926#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 38925#L236-8 assume { :end_inline_write_history_bool } true; 38923#L452 assume ~gate3Failed~0 % 256 != 0; 38924#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 39069#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 39067#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 39065#L486 assume ~VALUE1~0 == ~VALUE2~0; 39061#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 39051#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 39047#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 39046#L211-2 assume { :end_inline_write_history_int8 } true; 39045#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 38661#L294 assume !(~gate1Failed~0 % 256 == 0); 38662#L297 assume ~gate2Failed~0 % 256 == 0;check_~tmp~2 := 1; 38654#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 38613#L171-12 assume read_history_bool_~history_id == 0; 38614#L172-12 assume !(read_history_bool_~historyIndex == 0); 38490#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 38298#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 38454#L307 assume !(check_~tmp___3~0 % 256 == 0); 38726#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 38696#L151-7 assume read_history_int8_~history_id == 3; 38694#L152-7 assume !(read_history_int8_~historyIndex == 0); 38692#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 38541#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 38691#L346 assume !(check_~tmp___10~0 > -2); 38510#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 38690#L151-9 assume read_history_int8_~history_id == 3; 38689#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 38236#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 38237#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 38329#L366-1 check_#res := 1; 38328#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 38859#L583-72 assume !(assert_~arg % 256 == 0); 38858#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 38857#L558-3 assume true; 38856#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 38370#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 38371#L236-2 assume { :end_inline_write_history_bool } true; 38484#L390 assume ~gate1Failed~0 % 256 != 0; 38368#L391 [2018-11-10 08:08:42,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1360593371, now seen corresponding path program 1 times [2018-11-10 08:08:42,085 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:42,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:42,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:42,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:08:42,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:08:42,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:08:42,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:08:42,131 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:08:42,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:08:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1447132877, now seen corresponding path program 1 times [2018-11-10 08:08:42,132 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:08:42,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:08:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:08:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:08:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:08:42,754 WARN L179 SmtUtils]: Spent 586.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 221 [2018-11-10 08:08:46,907 WARN L179 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 207 DAG size of output: 184 [2018-11-10 08:08:46,910 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:46,910 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:46,910 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:46,911 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:46,911 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:08:46,911 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:46,911 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:46,911 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:46,911 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration18_Loop [2018-11-10 08:08:46,911 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:46,911 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:46,914 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 08:08:46,959 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 7407 disjunctions. This might take some time... [2018-11-10 08:08:47,169 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 74 disjunctions. [2018-11-10 08:08:47,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,234 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,289 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,472 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-10 08:08:47,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:47,721 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-10 08:08:47,921 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 08:08:47,969 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:08:55,329 WARN L179 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 320 DAG size of output: 148 [2018-11-10 08:08:55,362 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:08:55,362 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 41 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 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,381 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,381 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret20=0} Honda state: {ULTIMATE.start_check_#t~ret20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 42 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 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,405 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,406 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,413 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,413 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 43 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 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,441 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,441 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 44 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 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,467 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,467 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,473 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,473 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 45 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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,496 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,496 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,517 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,518 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 46 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 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,526 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,526 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,533 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,533 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 47 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,561 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,561 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 48 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 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,593 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,593 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 49 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 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,615 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,615 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,621 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,621 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 50 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,649 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,649 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 08:08:55,670 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,670 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,681 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,681 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 52 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,707 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,707 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 53 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,732 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,733 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 54 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,769 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,769 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,831 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,831 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Honda state: {v_rep#funAddr~gate1_each_pals_period.offset_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 08:08:55,836 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,837 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,849 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,849 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_~tmp___0~3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,877 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,877 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_11=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 58 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,896 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,897 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:55,900 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:08:55,900 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~history_id=3, ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_~history_id=3, ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:08:55,918 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:55,939 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:08:55,939 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:08:56,072 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 08:08:56,073 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:08:56,074 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:08:56,074 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:08:56,074 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:08:56,074 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:08:56,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:08:56,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:08:56,074 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:08:56,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration18_Loop [2018-11-10 08:08:56,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:08:56,074 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:08:56,078 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12 [2018-11-10 08:08:56,105 WARN L177 XnfTransformerHelper]: Simplifying conjuction of 7407 disjunctions. This might take some time... [2018-11-10 08:08:56,303 INFO L193 XnfTransformerHelper]: Simplified to conjuction of 74 disjunctions. [2018-11-10 08:08:56,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,309 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,464 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2018-11-10 08:08:56,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:08:56,807 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-11-10 08:08:56,950 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-11-10 08:08:57,046 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:09:04,261 WARN L179 SmtUtils]: Spent 7.19 s on a formula simplification. DAG size of input: 320 DAG size of output: 148 [2018-11-10 08:09:04,383 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:09:04,384 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:09:04,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,386 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,386 INFO L206 nArgumentSynthesizer]: 20 loop disjuncts [2018-11-10 08:09:04,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,414 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-10 08:09:04,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:09:04,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:09:04,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:09:04,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:09:04,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,668 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,675 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,676 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,676 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,677 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:09:04,678 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:09:04,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:04,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:04,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:04,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:04,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:04,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:04,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:04,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:04,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:04,685 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:09:04,686 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:09:04,686 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:09:04,686 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:09:04,686 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:09:04,687 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:09:04,687 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 08:09:04,687 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:09:05,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:05,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:05,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:09:05,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:05,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:09:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:09:05,096 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:09:05,096 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 987 states and 1407 transitions. cyclomatic complexity: 428 Second operand 5 states. [2018-11-10 08:09:05,129 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 987 states and 1407 transitions. cyclomatic complexity: 428. Second operand 5 states. Result 1674 states and 2405 transitions. Complement of second has 6 states. [2018-11-10 08:09:05,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:09:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:09:05,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 767 transitions. [2018-11-10 08:09:05,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 767 transitions. Stem has 59 letters. Loop has 54 letters. [2018-11-10 08:09:05,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:09:05,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 767 transitions. Stem has 113 letters. Loop has 54 letters. [2018-11-10 08:09:05,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:09:05,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 767 transitions. Stem has 59 letters. Loop has 108 letters. [2018-11-10 08:09:05,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:09:05,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1674 states and 2405 transitions. [2018-11-10 08:09:05,139 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 290 [2018-11-10 08:09:05,142 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1674 states to 882 states and 1252 transitions. [2018-11-10 08:09:05,142 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 577 [2018-11-10 08:09:05,143 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 577 [2018-11-10 08:09:05,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 882 states and 1252 transitions. [2018-11-10 08:09:05,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:09:05,143 INFO L705 BuchiCegarLoop]: Abstraction has 882 states and 1252 transitions. [2018-11-10 08:09:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states and 1252 transitions. [2018-11-10 08:09:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2018-11-10 08:09:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 882 states. [2018-11-10 08:09:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1252 transitions. [2018-11-10 08:09:05,154 INFO L728 BuchiCegarLoop]: Abstraction has 882 states and 1252 transitions. [2018-11-10 08:09:05,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:09:05,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:09:05,154 INFO L87 Difference]: Start difference. First operand 882 states and 1252 transitions. Second operand 4 states. [2018-11-10 08:09:05,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:09:05,259 INFO L93 Difference]: Finished difference Result 2569 states and 3626 transitions. [2018-11-10 08:09:05,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:09:05,260 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2569 states and 3626 transitions. [2018-11-10 08:09:05,266 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 956 [2018-11-10 08:09:05,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2569 states to 2569 states and 3626 transitions. [2018-11-10 08:09:05,275 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1758 [2018-11-10 08:09:05,276 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1758 [2018-11-10 08:09:05,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2569 states and 3626 transitions. [2018-11-10 08:09:05,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:09:05,276 INFO L705 BuchiCegarLoop]: Abstraction has 2569 states and 3626 transitions. [2018-11-10 08:09:05,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states and 3626 transitions. [2018-11-10 08:09:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 856. [2018-11-10 08:09:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 856 states. [2018-11-10 08:09:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1203 transitions. [2018-11-10 08:09:05,293 INFO L728 BuchiCegarLoop]: Abstraction has 856 states and 1203 transitions. [2018-11-10 08:09:05,293 INFO L608 BuchiCegarLoop]: Abstraction has 856 states and 1203 transitions. [2018-11-10 08:09:05,293 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-11-10 08:09:05,293 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 856 states and 1203 transitions. [2018-11-10 08:09:05,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-10 08:09:05,296 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:09:05,296 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:09:05,297 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:09:05,297 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:09:05,297 INFO L793 eck$LassoCheckResult]: Stem: 44885#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 44634#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44635#L116-3 assume true; 45064#L116-1 assume !!(add_history_type_~var~0 < 3); 44999#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 44819#L171 assume read_history_bool_~history_id == 0; 44820#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 44595#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 44801#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 44802#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 45065#L116-3 assume true; 45066#L116-1 assume !(add_history_type_~var~0 < 3); 45057#L116-4 add_history_type_#res := 1; 44839#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 44840#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44979#L116-8 assume true; 45090#L116-6 assume !!(add_history_type_~var~0 < 3); 44975#L117-2 assume !(add_history_type_~history_id == 0); 44976#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45067#L171-4 assume !(read_history_bool_~history_id == 0); 44899#L181-4 assume read_history_bool_~history_id == 1; 44900#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 44788#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44677#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 44678#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 45091#L116-8 assume true; 45092#L116-6 assume !(add_history_type_~var~0 < 3); 45085#L116-9 add_history_type_#res := 1; 44891#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 44831#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44832#L116-13 assume true; 45027#L116-11 assume !!(add_history_type_~var~0 < 3); 44968#L117-4 assume !(add_history_type_~history_id == 0); 44969#L123-4 assume !(add_history_type_~history_id == 1); 45115#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45095#L171-8 assume !(read_history_bool_~history_id == 0); 44926#L181-8 assume !(read_history_bool_~history_id == 1); 44693#L191-8 assume read_history_bool_~history_id == 2; 44695#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 44804#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 44651#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44652#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 44608#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 44609#L116-18 assume true; 45149#L116-16 assume !!(add_history_type_~var~0 < 3); 44952#L117-6 assume !(add_history_type_~history_id == 0); 44954#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45086#L171-10 assume !(read_history_bool_~history_id == 0); 44920#L181-10 assume read_history_bool_~history_id == 1; 44921#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 44700#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44663#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44641#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 44886#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 44837#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 44838#L558-3 assume true; 45155#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45385#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44941#L236-2 assume { :end_inline_write_history_bool } true; 44942#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 44902#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 44903#L399 [2018-11-10 08:09:05,297 INFO L795 eck$LassoCheckResult]: Loop: 44903#L399 assume gate1_each_pals_period_~next_state~0 == 1;gate1_each_pals_period_~tmp___0~3 := 1; 44824#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 45378#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 45062#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 45375#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45373#L226-2 assume !(write_history_bool_~history_id == 0); 45371#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 44905#L236-5 assume { :end_inline_write_history_bool } true; 44906#L421 assume ~gate2Failed~0 % 256 != 0; 45130#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 45427#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 45426#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 45425#L226-4 assume !(write_history_bool_~history_id == 0); 45424#L231-4 assume !(write_history_bool_~history_id == 1); 45422#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 45420#L236-8 assume { :end_inline_write_history_bool } true; 45418#L452 assume ~gate3Failed~0 % 256 != 0; 44991#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 44962#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 44963#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 44985#L486 assume ~VALUE1~0 == ~VALUE2~0; 44987#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 44630#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 45141#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 45056#L211-2 assume { :end_inline_write_history_int8 } true; 45123#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 45124#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 45180#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 45179#L171-12 assume read_history_bool_~history_id == 0; 44981#L172-12 assume !(read_history_bool_~historyIndex == 0); 44948#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 44911#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 44912#L307 assume !(check_~tmp___3~0 % 256 == 0); 45163#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 45162#L151-7 assume !(read_history_int8_~history_id == 3);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 45008#L583-54 assume !(assert_~arg % 256 == 0); 45009#L578-27 assume { :end_inline_assert } true;read_history_int8_#res := -2; 44998#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 45159#L346 assume !(check_~tmp___10~0 > -2); 44972#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 45158#L151-9 assume read_history_int8_~history_id == 3; 45157#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 44996#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 45156#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 44786#L366-1 check_#res := 1; 44772#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 44773#L583-72 assume !(assert_~arg % 256 == 0); 44977#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 45000#L558-3 assume true; 45138#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 44825#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44826#L236-2 assume { :end_inline_write_history_bool } true; 45384#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 45381#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 44903#L399 [2018-11-10 08:09:05,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:05,298 INFO L82 PathProgramCache]: Analyzing trace with hash 260785083, now seen corresponding path program 1 times [2018-11-10 08:09:05,298 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:09:05,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:09:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:09:05,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:05,350 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:09:05,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:09:05,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:09:05,351 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:09:05,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:05,351 INFO L82 PathProgramCache]: Analyzing trace with hash -981140450, now seen corresponding path program 1 times [2018-11-10 08:09:05,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:09:05,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:09:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:09:05,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:05,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:09:05,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:09:05,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:09:05,371 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:09:05,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:09:05,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:09:05,371 INFO L87 Difference]: Start difference. First operand 856 states and 1203 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-11-10 08:09:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:09:05,408 INFO L93 Difference]: Finished difference Result 1382 states and 1936 transitions. [2018-11-10 08:09:05,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:09:05,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1382 states and 1936 transitions. [2018-11-10 08:09:05,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 264 [2018-11-10 08:09:05,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1382 states to 1382 states and 1936 transitions. [2018-11-10 08:09:05,415 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 896 [2018-11-10 08:09:05,416 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 896 [2018-11-10 08:09:05,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1382 states and 1936 transitions. [2018-11-10 08:09:05,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:09:05,416 INFO L705 BuchiCegarLoop]: Abstraction has 1382 states and 1936 transitions. [2018-11-10 08:09:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states and 1936 transitions. [2018-11-10 08:09:05,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 822. [2018-11-10 08:09:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 822 states. [2018-11-10 08:09:05,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1150 transitions. [2018-11-10 08:09:05,426 INFO L728 BuchiCegarLoop]: Abstraction has 822 states and 1150 transitions. [2018-11-10 08:09:05,426 INFO L608 BuchiCegarLoop]: Abstraction has 822 states and 1150 transitions. [2018-11-10 08:09:05,427 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-11-10 08:09:05,427 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 822 states and 1150 transitions. [2018-11-10 08:09:05,429 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 264 [2018-11-10 08:09:05,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:09:05,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:09:05,430 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:09:05,430 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:09:05,430 INFO L793 eck$LassoCheckResult]: Stem: 47131#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 46880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 46881#L116-3 assume true; 47278#L116-1 assume !!(add_history_type_~var~0 < 3); 47236#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47069#L171 assume read_history_bool_~history_id == 0; 47070#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 46841#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 47051#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 47052#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 47279#L116-3 assume true; 47280#L116-1 assume !(add_history_type_~var~0 < 3); 47273#L116-4 add_history_type_#res := 1; 47088#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 47089#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 47218#L116-8 assume true; 47297#L116-6 assume !!(add_history_type_~var~0 < 3); 47214#L117-2 assume !(add_history_type_~history_id == 0); 47215#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47281#L171-4 assume !(read_history_bool_~history_id == 0); 47145#L181-4 assume read_history_bool_~history_id == 1; 47146#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 47038#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 46925#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 46926#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 47298#L116-8 assume true; 47299#L116-6 assume !(add_history_type_~var~0 < 3); 47292#L116-9 add_history_type_#res := 1; 47137#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 47081#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 47082#L116-13 assume true; 47252#L116-11 assume !!(add_history_type_~var~0 < 3); 47209#L117-4 assume !(add_history_type_~history_id == 0); 47210#L123-4 assume !(add_history_type_~history_id == 1); 47323#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47302#L171-8 assume !(read_history_bool_~history_id == 0); 47170#L181-8 assume !(read_history_bool_~history_id == 1); 46941#L191-8 assume read_history_bool_~history_id == 2; 46943#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 47054#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 46897#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 46898#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 46854#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 46855#L116-18 assume true; 47358#L116-16 assume !!(add_history_type_~var~0 < 3); 47195#L117-6 assume !(add_history_type_~history_id == 0); 47197#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47293#L171-10 assume !(read_history_bool_~history_id == 0); 47164#L181-10 assume read_history_bool_~history_id == 1; 47165#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 46948#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 46910#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 46887#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 47132#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 47086#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 47087#L558-3 assume true; 47362#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47511#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 47509#L236-2 assume { :end_inline_write_history_bool } true; 47508#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 47507#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 47149#L399 [2018-11-10 08:09:05,430 INFO L795 eck$LassoCheckResult]: Loop: 47149#L399 assume gate1_each_pals_period_~next_state~0 == 1;gate1_each_pals_period_~tmp___0~3 := 1; 47074#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 47083#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 47276#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 47201#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47065#L226-2 assume !(write_history_bool_~history_id == 0); 47066#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 47093#L236-5 assume { :end_inline_write_history_bool } true; 47151#L421 assume ~gate2Failed~0 % 256 != 0; 47336#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 47501#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 47496#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47494#L226-4 assume !(write_history_bool_~history_id == 0); 47492#L231-4 assume !(write_history_bool_~history_id == 1); 47484#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 47482#L236-8 assume { :end_inline_write_history_bool } true; 47480#L452 assume ~gate3Failed~0 % 256 != 0; 47230#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 47205#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 47206#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 47224#L486 assume ~VALUE1~0 == ~VALUE2~0; 47226#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 46914#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 47611#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 47272#L211-2 assume { :end_inline_write_history_int8 } true; 47345#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 47395#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 47393#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 47391#L171-12 assume read_history_bool_~history_id == 0; 47388#L172-12 assume !(read_history_bool_~historyIndex == 0); 47386#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 47383#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 47366#L307 assume !(check_~tmp___3~0 % 256 == 0); 46902#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 46903#L151-7 assume read_history_int8_~history_id == 3; 47312#L152-7 assume !(read_history_int8_~historyIndex == 0); 47357#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 47235#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 47356#L346 assume !(check_~tmp___10~0 > -2); 47213#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 47355#L151-9 assume read_history_int8_~history_id == 3; 47354#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 47233#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 47353#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 47036#L366-1 check_#res := 1; 47035#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 47523#L583-72 assume !(assert_~arg % 256 == 0); 47237#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 47238#L558-3 assume true; 47343#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 47075#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 47076#L236-2 assume { :end_inline_write_history_bool } true; 47185#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 47148#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 47149#L399 [2018-11-10 08:09:05,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:05,431 INFO L82 PathProgramCache]: Analyzing trace with hash 260785083, now seen corresponding path program 2 times [2018-11-10 08:09:05,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:09:05,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:09:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:09:05,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-10 08:09:05,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:09:05,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:09:05,488 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:09:05,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1355474039, now seen corresponding path program 1 times [2018-11-10 08:09:05,488 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:09:05,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:09:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,489 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:09:05,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:09:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:09:06,164 WARN L179 SmtUtils]: Spent 641.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 222 [2018-11-10 08:09:07,727 WARN L179 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2018-11-10 08:09:07,729 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:09:07,729 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:09:07,729 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:09:07,729 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:09:07,729 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:09:07,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:07,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:09:07,730 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:09:07,730 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-10 08:09:07,730 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:09:07,730 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:09:07,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,860 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-10 08:09:07,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,895 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:07,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:08,159 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 08:09:08,302 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-10 08:09:08,378 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 08:09:13,331 WARN L179 SmtUtils]: Spent 4.94 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-11-10 08:09:13,454 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:09:13,454 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:13,462 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:13,462 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:13,464 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:13,464 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret21=0} Honda state: {ULTIMATE.start_check_#t~ret21=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:13,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:13,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:13,484 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:13,484 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet35=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:13,501 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:13,501 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:13,519 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:13,519 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:13,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:13,522 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:13,524 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:13,524 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 65 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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:13,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:13,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:13,549 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:13,549 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:13,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:13,573 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:14,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:09:14,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:26,700 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 08:09:26,714 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:09:26,714 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:09:26,714 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:09:26,714 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:09:26,714 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:09:26,715 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:26,715 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:09:26,715 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:09:26,715 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-11-10 08:09:26,715 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:09:26,715 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:09:26,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,758 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,917 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-11-10 08:09:26,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:26,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:27,191 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-11-10 08:09:27,308 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-11-10 08:09:27,371 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-10 08:09:32,527 WARN L179 SmtUtils]: Spent 5.12 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-11-10 08:09:32,625 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:09:32,625 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:09:32,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:09:32,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:09:32,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,651 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,657 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,658 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,659 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,659 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,661 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,662 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,662 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,663 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,664 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,664 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,664 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:09:32,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:09:32,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,670 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,671 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,672 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,672 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,674 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,675 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:09:32,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:09:32,678 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,679 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,679 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,681 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,682 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,683 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,686 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,689 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,690 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:09:32,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,691 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:09:32,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,691 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:09:32,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:09:32,692 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:09:32,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:09:32,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:09:32,692 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-11-10 08:09:32,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:09:32,715 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-10 08:09:32,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:09:32,831 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:09:33,022 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-10 08:09:33,022 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 08:09:33,022 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:09:33,023 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:09:33,023 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:09:33,023 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(~votedValue_History_0~0, ~g1v_old~0, ~nomsg~0) = -1*~votedValue_History_0~0 - 1*~g1v_old~0 + 1*~nomsg~0 Supporting invariants [] [2018-11-10 08:09:33,023 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:09:33,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:33,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:09:33,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:33,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:09:33,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:09:33,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 15 loop predicates [2018-11-10 08:09:33,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 822 states and 1150 transitions. cyclomatic complexity: 336 Second operand 16 states. [2018-11-10 08:09:34,297 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 822 states and 1150 transitions. cyclomatic complexity: 336. Second operand 16 states. Result 3756 states and 5169 transitions. Complement of second has 37 states. [2018-11-10 08:09:34,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-10 08:09:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-10 08:09:34,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1789 transitions. [2018-11-10 08:09:34,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1789 transitions. Stem has 61 letters. Loop has 54 letters. [2018-11-10 08:09:34,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:09:34,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1789 transitions. Stem has 115 letters. Loop has 54 letters. [2018-11-10 08:09:34,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:09:34,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1789 transitions. Stem has 61 letters. Loop has 108 letters. [2018-11-10 08:09:34,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:09:34,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3756 states and 5169 transitions. [2018-11-10 08:09:34,309 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 526 [2018-11-10 08:09:34,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3756 states to 2634 states and 3661 transitions. [2018-11-10 08:09:34,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2131 [2018-11-10 08:09:34,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2134 [2018-11-10 08:09:34,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2634 states and 3661 transitions. [2018-11-10 08:09:34,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:09:34,317 INFO L705 BuchiCegarLoop]: Abstraction has 2634 states and 3661 transitions. [2018-11-10 08:09:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2634 states and 3661 transitions. [2018-11-10 08:09:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2634 to 1482. [2018-11-10 08:09:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2018-11-10 08:09:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2080 transitions. [2018-11-10 08:09:34,340 INFO L728 BuchiCegarLoop]: Abstraction has 1482 states and 2080 transitions. [2018-11-10 08:09:34,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:09:34,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:09:34,340 INFO L87 Difference]: Start difference. First operand 1482 states and 2080 transitions. Second operand 4 states. [2018-11-10 08:09:34,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:09:34,367 INFO L93 Difference]: Finished difference Result 2807 states and 3944 transitions. [2018-11-10 08:09:34,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:09:34,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2807 states and 3944 transitions. [2018-11-10 08:09:34,373 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1052 [2018-11-10 08:09:34,379 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2807 states to 2805 states and 3942 transitions. [2018-11-10 08:09:34,379 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1922 [2018-11-10 08:09:34,380 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1922 [2018-11-10 08:09:34,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2805 states and 3942 transitions. [2018-11-10 08:09:34,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:09:34,381 INFO L705 BuchiCegarLoop]: Abstraction has 2805 states and 3942 transitions. [2018-11-10 08:09:34,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states and 3942 transitions. [2018-11-10 08:09:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 1482. [2018-11-10 08:09:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1482 states. [2018-11-10 08:09:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 2079 transitions. [2018-11-10 08:09:34,403 INFO L728 BuchiCegarLoop]: Abstraction has 1482 states and 2079 transitions. [2018-11-10 08:09:34,403 INFO L608 BuchiCegarLoop]: Abstraction has 1482 states and 2079 transitions. [2018-11-10 08:09:34,403 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-11-10 08:09:34,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1482 states and 2079 transitions. [2018-11-10 08:09:34,407 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 526 [2018-11-10 08:09:34,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:09:34,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:09:34,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:09:34,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:09:34,408 INFO L793 eck$LassoCheckResult]: Stem: 56445#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 56188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56189#L116-3 assume true; 56612#L116-1 assume !!(add_history_type_~var~0 < 3); 56558#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56377#L171 assume read_history_bool_~history_id == 0; 56378#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 56149#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 56359#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 56360#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 56613#L116-3 assume true; 56614#L116-1 assume !(add_history_type_~var~0 < 3); 56606#L116-4 add_history_type_#res := 1; 56396#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 56397#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56539#L116-8 assume true; 56634#L116-6 assume !!(add_history_type_~var~0 < 3); 56535#L117-2 assume !(add_history_type_~history_id == 0); 56536#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56615#L171-4 assume !(read_history_bool_~history_id == 0); 56462#L181-4 assume read_history_bool_~history_id == 1; 56463#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 56345#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 56232#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 56233#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 56635#L116-8 assume true; 56636#L116-6 assume !(add_history_type_~var~0 < 3); 56629#L116-9 add_history_type_#res := 1; 56452#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 56389#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56390#L116-13 assume true; 56580#L116-11 assume !!(add_history_type_~var~0 < 3); 56530#L117-4 assume !(add_history_type_~history_id == 0); 56531#L123-4 assume !(add_history_type_~history_id == 1); 56659#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56639#L171-8 assume !(read_history_bool_~history_id == 0); 56487#L181-8 assume !(read_history_bool_~history_id == 1); 56248#L191-8 assume read_history_bool_~history_id == 2; 56250#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 56362#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 56205#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 56206#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 56647#L116-13 assume true; 56700#L116-11 assume !(add_history_type_~var~0 < 3); 56577#L116-14 add_history_type_#res := 1; 56447#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 56162#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 56163#L116-18 assume true; 56592#L116-16 assume !!(add_history_type_~var~0 < 3); 56517#L117-6 assume !(add_history_type_~history_id == 0); 56519#L123-6 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 56630#L171-10 assume !(read_history_bool_~history_id == 0); 56481#L181-10 assume read_history_bool_~history_id == 1; 56482#L182-10 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 56255#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 56217#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 56195#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 56446#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 56394#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 56395#L558-3 assume true; 56882#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 57488#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 57487#L236-2 assume { :end_inline_write_history_bool } true; 57485#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 57484#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 56879#L399 assume !(gate1_each_pals_period_~next_state~0 == 1); 56381#L402 [2018-11-10 08:09:34,408 INFO L795 eck$LassoCheckResult]: Loop: 56381#L402 assume gate1_each_pals_period_~next_state~0 == 2;gate1_each_pals_period_~tmp___0~3 := 1; 56382#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 56391#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 56610#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 57574#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 57573#L226-2 assume !(write_history_bool_~history_id == 0); 57571#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 57546#L236-5 assume { :end_inline_write_history_bool } true; 57545#L421 assume ~gate2Failed~0 % 256 != 0; 56318#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 56258#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 56259#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 57548#L226-4 assume !(write_history_bool_~history_id == 0); 57547#L231-4 assume !(write_history_bool_~history_id == 1); 56456#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 56457#L236-8 assume { :end_inline_write_history_bool } true; 56491#L452 assume ~gate3Failed~0 % 256 != 0; 56597#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 57606#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 57605#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 57602#L486 assume ~VALUE1~0 == ~VALUE2~0; 57586#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 57382#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 57580#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 56605#L211-2 assume { :end_inline_write_history_int8 } true; 57576#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 57279#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 57277#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 57275#L171-12 assume read_history_bool_~history_id == 0; 57274#L172-12 assume !(read_history_bool_~historyIndex == 0); 57273#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 57270#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 57269#L307 assume !(check_~tmp___3~0 % 256 == 0); 56209#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 56210#L151-7 assume read_history_int8_~history_id == 3; 56273#L152-7 assume !(read_history_int8_~historyIndex == 0); 56274#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 56277#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 56278#L346 assume !(check_~tmp___10~0 > -2); 56494#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 56495#L151-9 assume read_history_int8_~history_id == 3; 56262#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 56264#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 56267#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 56343#L366-1 check_#res := 1; 56327#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 56328#L583-72 assume !(assert_~arg % 256 == 0); 56537#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 56693#L558-3 assume true; 56685#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 56383#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 56384#L236-2 assume { :end_inline_write_history_bool } true; 56503#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 56465#L396 assume !(gate1_each_pals_period_~next_state~0 == 0); 56466#L399 assume !(gate1_each_pals_period_~next_state~0 == 1); 56381#L402 [2018-11-10 08:09:34,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:34,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1946790118, now seen corresponding path program 1 times [2018-11-10 08:09:34,409 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:09:34,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:09:34,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:34,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:09:34,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:09:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:09:34,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:09:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 08:09:34,468 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:09:34,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:09:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 101975071, now seen corresponding path program 1 times [2018-11-10 08:09:34,468 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:09:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:09:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:34,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:09:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:09:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:09:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:09:35,067 WARN L179 SmtUtils]: Spent 572.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 224 [2018-11-10 08:09:36,674 WARN L179 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 193 DAG size of output: 174 [2018-11-10 08:09:36,676 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:09:36,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:09:36,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:09:36,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:09:36,676 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:09:36,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:36,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:09:36,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:09:36,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-11-10 08:09:36,676 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:09:36,677 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:09:36,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,866 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 83 [2018-11-10 08:09:36,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:36,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:09:37,203 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 141 [2018-11-10 08:09:37,367 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:09:43,123 WARN L179 SmtUtils]: Spent 5.72 s on a formula simplification. DAG size of input: 261 DAG size of output: 145 [2018-11-10 08:09:43,211 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:09:43,211 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:43,217 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:43,217 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:43,219 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:43,220 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:43,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:09:43,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:09:43,245 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:09:43,245 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___4~0=0} Honda state: {ULTIMATE.start_check_~tmp___4~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:09:43,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-11-10 08:10:19,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:19,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:19,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:19,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:19,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:19,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:19,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:19,982 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:19,982 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:19,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:19,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:19,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:19,983 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:19,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:19,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:19,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:19,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:19,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:19,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:19,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:19,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:19,984 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:19,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:19,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:19,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:19,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:19,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:19,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:19,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:19,986 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:19,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:19,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:19,986 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:19,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:19,986 INFO L206 nArgumentSynthesizer]: 6 loop disjuncts [2018-11-10 08:10:19,987 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:19,992 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 08:10:19,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,026 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,027 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,027 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:20,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:20,030 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,030 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,030 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,035 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,036 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,038 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,039 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,040 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:20,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:20,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:20,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:20,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:20,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:20,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:20,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:20,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:20,043 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:10:20,044 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:10:20,044 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:10:20,044 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:10:20,044 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:10:20,044 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:10:20,044 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 08:10:20,045 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:10:20,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:20,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:20,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:20,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:20,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:10:20,186 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:10:20,186 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1587 states and 2198 transitions. cyclomatic complexity: 619 Second operand 5 states. [2018-11-10 08:10:20,204 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1587 states and 2198 transitions. cyclomatic complexity: 619. Second operand 5 states. Result 3441 states and 4804 transitions. Complement of second has 6 states. [2018-11-10 08:10:20,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:10:20,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:10:20,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 620 transitions. [2018-11-10 08:10:20,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 620 transitions. Stem has 92 letters. Loop has 55 letters. [2018-11-10 08:10:20,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:10:20,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 620 transitions. Stem has 147 letters. Loop has 55 letters. [2018-11-10 08:10:20,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:10:20,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 620 transitions. Stem has 92 letters. Loop has 110 letters. [2018-11-10 08:10:20,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:10:20,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3441 states and 4804 transitions. [2018-11-10 08:10:20,217 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 517 [2018-11-10 08:10:20,220 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3441 states to 1579 states and 2158 transitions. [2018-11-10 08:10:20,220 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1124 [2018-11-10 08:10:20,221 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1124 [2018-11-10 08:10:20,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1579 states and 2158 transitions. [2018-11-10 08:10:20,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:20,221 INFO L705 BuchiCegarLoop]: Abstraction has 1579 states and 2158 transitions. [2018-11-10 08:10:20,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states and 2158 transitions. [2018-11-10 08:10:20,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2018-11-10 08:10:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1579 states. [2018-11-10 08:10:20,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2158 transitions. [2018-11-10 08:10:20,236 INFO L728 BuchiCegarLoop]: Abstraction has 1579 states and 2158 transitions. [2018-11-10 08:10:20,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:10:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:10:20,236 INFO L87 Difference]: Start difference. First operand 1579 states and 2158 transitions. Second operand 4 states. [2018-11-10 08:10:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:10:20,309 INFO L93 Difference]: Finished difference Result 2772 states and 3739 transitions. [2018-11-10 08:10:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:10:20,309 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2772 states and 3739 transitions. [2018-11-10 08:10:20,315 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 950 [2018-11-10 08:10:20,320 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2772 states to 2772 states and 3739 transitions. [2018-11-10 08:10:20,320 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1861 [2018-11-10 08:10:20,321 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1861 [2018-11-10 08:10:20,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2772 states and 3739 transitions. [2018-11-10 08:10:20,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:20,321 INFO L705 BuchiCegarLoop]: Abstraction has 2772 states and 3739 transitions. [2018-11-10 08:10:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states and 3739 transitions. [2018-11-10 08:10:20,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2180. [2018-11-10 08:10:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2180 states. [2018-11-10 08:10:20,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2180 states to 2180 states and 2948 transitions. [2018-11-10 08:10:20,340 INFO L728 BuchiCegarLoop]: Abstraction has 2180 states and 2948 transitions. [2018-11-10 08:10:20,340 INFO L608 BuchiCegarLoop]: Abstraction has 2180 states and 2948 transitions. [2018-11-10 08:10:20,340 INFO L442 BuchiCegarLoop]: ======== Iteration 25============ [2018-11-10 08:10:20,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2180 states and 2948 transitions. [2018-11-10 08:10:20,343 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 683 [2018-11-10 08:10:20,343 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:10:20,343 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:10:20,344 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:20,344 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:20,344 INFO L793 eck$LassoCheckResult]: Stem: 89922#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 89684#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 89685#L116-3 assume true; 90070#L116-1 assume !!(add_history_type_~var~0 < 3); 90021#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 89856#L171 assume read_history_bool_~history_id == 0; 89857#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 89651#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 89842#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 89843#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 90071#L116-3 assume true; 90072#L116-1 assume !(add_history_type_~var~0 < 3); 90062#L116-4 add_history_type_#res := 1; 89876#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 89877#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 90002#L116-8 assume true; 90090#L116-6 assume !!(add_history_type_~var~0 < 3); 89998#L117-2 assume !(add_history_type_~history_id == 0); 89999#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 90073#L171-4 assume !(read_history_bool_~history_id == 0); 89938#L181-4 assume read_history_bool_~history_id == 1; 89939#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 89828#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 89722#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 89723#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 90091#L116-8 assume true; 90092#L116-6 assume !(add_history_type_~var~0 < 3); 90087#L116-9 add_history_type_#res := 1; 89930#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 89866#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 89867#L116-13 assume true; 90167#L116-11 assume !!(add_history_type_~var~0 < 3); 89993#L117-4 assume !(add_history_type_~history_id == 0); 89994#L123-4 assume !(add_history_type_~history_id == 1); 90117#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 90095#L171-8 assume !(read_history_bool_~history_id == 0); 89955#L181-8 assume !(read_history_bool_~history_id == 1); 89732#L191-8 assume read_history_bool_~history_id == 2; 89734#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 89845#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 89696#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 89697#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 90038#L116-13 assume true; 90039#L116-11 assume !(add_history_type_~var~0 < 3); 90034#L116-14 add_history_type_#res := 1; 89925#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 89664#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 89665#L116-18 assume true; 90055#L116-16 assume !!(add_history_type_~var~0 < 3); 89981#L117-6 assume !(add_history_type_~history_id == 0); 89982#L123-6 assume !(add_history_type_~history_id == 1); 90106#L129-6 assume !(add_history_type_~history_id == 2); 89818#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 89819#L151-3 assume read_history_int8_~history_id == 3; 89829#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 89831#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 89837#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 89814#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 89815#L116-18 assume true; 90050#L116-16 assume !(add_history_type_~var~0 < 3); 90049#L116-19 add_history_type_#res := 1; 89923#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 89924#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 89872#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 89873#L558-3 assume true; 90545#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 90537#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 90520#L236-2 assume { :end_inline_write_history_bool } true; 90519#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 90517#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 90518#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 91517#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 91516#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 91515#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91514#L226-2 assume !(write_history_bool_~history_id == 0); 91512#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 91509#L236-5 assume { :end_inline_write_history_bool } true; 91506#L421 assume ~gate2Failed~0 % 256 != 0; 91504#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 91502#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 91500#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91499#L226-4 assume !(write_history_bool_~history_id == 0); 91498#L231-4 assume !(write_history_bool_~history_id == 1); 91489#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 91488#L236-8 assume { :end_inline_write_history_bool } true; 91486#L452 assume ~gate3Failed~0 % 256 != 0; 91485#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 91484#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 91483#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 91480#L486 assume ~VALUE1~0 == ~VALUE2~0; 91477#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 91475#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 91472#L211 assume !(write_history_int8_~history_id == 3);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 91469#L583-40 [2018-11-10 08:10:20,344 INFO L795 eck$LassoCheckResult]: Loop: 91469#L583-40 assume !(assert_~arg % 256 == 0); 91470#L578-20 assume { :end_inline_assert } true; 91466#L211-2 assume { :end_inline_write_history_int8 } true; 91465#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 91418#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 91416#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 91412#L171-12 assume read_history_bool_~history_id == 0; 91410#L172-12 assume !(read_history_bool_~historyIndex == 0); 91409#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 91406#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 91313#L307 assume !(check_~tmp___3~0 % 256 == 0); 90744#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 91242#L151-7 assume read_history_int8_~history_id == 3; 91240#L152-7 assume !(read_history_int8_~historyIndex == 0); 91236#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 91235#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 91233#L346 assume !(check_~tmp___10~0 > -2); 89997#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 91230#L151-9 assume read_history_int8_~history_id == 3; 91229#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 91227#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 91225#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 89826#L366-1 check_#res := 1; 89809#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 89810#L583-72 assume !(assert_~arg % 256 == 0); 90000#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 90022#L558-3 assume true; 90153#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 90154#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 90735#L236-2 assume { :end_inline_write_history_bool } true; 90734#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 90407#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 90408#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 91752#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 91751#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 91750#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91749#L226-2 assume !(write_history_bool_~history_id == 0); 91746#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 91742#L236-5 assume { :end_inline_write_history_bool } true; 91739#L421 assume ~gate2Failed~0 % 256 != 0; 91740#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 91790#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 91788#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 91787#L226-4 assume !(write_history_bool_~history_id == 0); 91786#L231-4 assume !(write_history_bool_~history_id == 1); 91785#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 91783#L236-8 assume { :end_inline_write_history_bool } true; 91781#L452 assume ~gate3Failed~0 % 256 != 0; 90015#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 89989#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 89990#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 91482#L486 assume !(~VALUE1~0 == ~VALUE2~0); 91478#L493 assume ~VALUE1~0 == ~VALUE3~0; 91474#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 91471#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 91468#L211 assume !(write_history_int8_~history_id == 3);assume { :begin_inline_assert } true;assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 91469#L583-40 [2018-11-10 08:10:20,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash -2060691287, now seen corresponding path program 1 times [2018-11-10 08:10:20,344 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:20,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:20,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 08:10:20,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:10:20,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:10:20,432 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:10:20,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:20,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1795312234, now seen corresponding path program 1 times [2018-11-10 08:10:20,432 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:20,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:20,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:10:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:10:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:10:20,462 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:10:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:10:20,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:10:20,463 INFO L87 Difference]: Start difference. First operand 2180 states and 2948 transitions. cyclomatic complexity: 776 Second operand 3 states. [2018-11-10 08:10:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:10:20,472 INFO L93 Difference]: Finished difference Result 2172 states and 2908 transitions. [2018-11-10 08:10:20,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:10:20,472 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2172 states and 2908 transitions. [2018-11-10 08:10:20,476 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 651 [2018-11-10 08:10:20,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2172 states to 2172 states and 2908 transitions. [2018-11-10 08:10:20,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1408 [2018-11-10 08:10:20,479 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1408 [2018-11-10 08:10:20,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2172 states and 2908 transitions. [2018-11-10 08:10:20,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:20,479 INFO L705 BuchiCegarLoop]: Abstraction has 2172 states and 2908 transitions. [2018-11-10 08:10:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states and 2908 transitions. [2018-11-10 08:10:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2148. [2018-11-10 08:10:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2018-11-10 08:10:20,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2884 transitions. [2018-11-10 08:10:20,495 INFO L728 BuchiCegarLoop]: Abstraction has 2148 states and 2884 transitions. [2018-11-10 08:10:20,495 INFO L608 BuchiCegarLoop]: Abstraction has 2148 states and 2884 transitions. [2018-11-10 08:10:20,495 INFO L442 BuchiCegarLoop]: ======== Iteration 26============ [2018-11-10 08:10:20,496 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2148 states and 2884 transitions. [2018-11-10 08:10:20,501 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 651 [2018-11-10 08:10:20,501 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:10:20,501 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:10:20,502 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:20,503 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:20,503 INFO L793 eck$LassoCheckResult]: Stem: 94290#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 94043#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94044#L116-3 assume true; 94433#L116-1 assume !!(add_history_type_~var~0 < 3); 94387#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 94216#L171 assume read_history_bool_~history_id == 0; 94217#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 94010#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 94202#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 94203#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 94434#L116-3 assume true; 94435#L116-1 assume !(add_history_type_~var~0 < 3); 94427#L116-4 add_history_type_#res := 1; 94235#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 94236#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94368#L116-8 assume true; 94454#L116-6 assume !!(add_history_type_~var~0 < 3); 94364#L117-2 assume !(add_history_type_~history_id == 0); 94365#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 94436#L171-4 assume !(read_history_bool_~history_id == 0); 94306#L181-4 assume read_history_bool_~history_id == 1; 94307#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 94189#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 94081#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 94082#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 94455#L116-8 assume true; 94456#L116-6 assume !(add_history_type_~var~0 < 3); 94451#L116-9 add_history_type_#res := 1; 94298#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 94226#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94227#L116-13 assume true; 94543#L116-11 assume !!(add_history_type_~var~0 < 3); 94360#L117-4 assume !(add_history_type_~history_id == 0); 94362#L123-4 assume !(add_history_type_~history_id == 1); 94490#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 94461#L171-8 assume !(read_history_bool_~history_id == 0); 94322#L181-8 assume !(read_history_bool_~history_id == 1); 94091#L191-8 assume read_history_bool_~history_id == 2; 94093#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 94205#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 94055#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 94056#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 94403#L116-13 assume true; 94404#L116-11 assume !(add_history_type_~var~0 < 3); 94400#L116-14 add_history_type_#res := 1; 94293#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 94023#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 94024#L116-18 assume true; 94419#L116-16 assume !!(add_history_type_~var~0 < 3); 94348#L117-6 assume !(add_history_type_~history_id == 0); 94350#L123-6 assume !(add_history_type_~history_id == 1); 94477#L129-6 assume !(add_history_type_~history_id == 2); 94179#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94180#L151-3 assume read_history_int8_~history_id == 3; 94190#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 94192#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 94198#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 94175#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 94176#L116-18 assume true; 94530#L116-16 assume !(add_history_type_~var~0 < 3); 94418#L116-19 add_history_type_#res := 1; 94291#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 94292#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 94232#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 94233#L558-3 assume true; 94849#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 94844#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 94843#L236-2 assume { :end_inline_write_history_bool } true; 94842#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 94840#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 94841#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 95513#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 95510#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 95507#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95505#L226-2 assume !(write_history_bool_~history_id == 0); 95500#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 95495#L236-5 assume { :end_inline_write_history_bool } true; 95492#L421 assume ~gate2Failed~0 % 256 != 0; 95491#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 95490#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 95489#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95488#L226-4 assume !(write_history_bool_~history_id == 0); 95487#L231-4 assume !(write_history_bool_~history_id == 1); 95480#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 95478#L236-8 assume { :end_inline_write_history_bool } true; 95475#L452 assume ~gate3Failed~0 % 256 != 0; 95472#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 95469#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 95468#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 95466#L486 assume ~VALUE1~0 == ~VALUE2~0; 95465#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 95398#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 95397#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 95395#L211-2 assume { :end_inline_write_history_int8 } true; 95341#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 95281#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 95278#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 95274#L171-12 assume read_history_bool_~history_id == 0; 95270#L172-12 assume !(read_history_bool_~historyIndex == 0); 95268#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 95264#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 94961#L307 assume !(check_~tmp___3~0 % 256 == 0); 94954#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94952#L151-7 assume read_history_int8_~history_id == 3; 94950#L152-7 assume !(read_history_int8_~historyIndex == 0); 94947#L155-7 assume !(read_history_int8_~historyIndex == 1);read_history_int8_#res := ~votedValue_History_2~0; 94945#L163-7 [2018-11-10 08:10:20,855 INFO L795 eck$LassoCheckResult]: Loop: 94945#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 94943#L346 assume !(check_~tmp___10~0 > -2); 94912#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94941#L151-9 assume read_history_int8_~history_id == 3; 94940#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 94937#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 94916#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 94910#L366-1 check_#res := 1; 94904#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 94902#L583-72 assume !(assert_~arg % 256 == 0); 94903#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 94898#L558-3 assume true; 94899#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95386#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 95385#L236-2 assume { :end_inline_write_history_bool } true; 95384#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 95383#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 95382#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 95381#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 95380#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 95379#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95378#L226-2 assume !(write_history_bool_~history_id == 0); 95372#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 95368#L236-5 assume { :end_inline_write_history_bool } true; 95365#L421 assume ~gate2Failed~0 % 256 != 0; 95363#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 95361#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 95360#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 95359#L226-4 assume !(write_history_bool_~history_id == 0); 95355#L231-4 assume !(write_history_bool_~history_id == 1); 95283#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 95279#L236-8 assume { :end_inline_write_history_bool } true; 95276#L452 assume ~gate3Failed~0 % 256 != 0; 95277#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 95459#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 95458#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 95455#L486 assume ~VALUE1~0 == ~VALUE2~0; 95444#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 95175#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 95430#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 95426#L211-2 assume { :end_inline_write_history_int8 } true; 95422#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 95089#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 95086#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 95083#L171-12 assume read_history_bool_~history_id == 0; 95081#L172-12 assume !(read_history_bool_~historyIndex == 0); 95078#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 95073#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 95071#L307 assume !(check_~tmp___3~0 % 256 == 0); 94908#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 94989#L151-7 assume read_history_int8_~history_id == 3; 94988#L152-7 assume !(read_history_int8_~historyIndex == 0); 94946#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 94945#L163-7 [2018-11-10 08:10:20,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:20,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1540104715, now seen corresponding path program 1 times [2018-11-10 08:10:20,866 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:20,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-10 08:10:20,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:10:20,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:10:20,967 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:10:20,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:20,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1700826180, now seen corresponding path program 4 times [2018-11-10 08:10:20,967 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:20,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:10:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:10:21,674 WARN L179 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 250 DAG size of output: 217 [2018-11-10 08:10:23,078 WARN L179 SmtUtils]: Spent 1.39 s on a formula simplification. DAG size of input: 181 DAG size of output: 162 [2018-11-10 08:10:23,079 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:10:23,080 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:10:23,080 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:10:23,080 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:10:23,080 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:10:23,080 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:23,080 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:10:23,080 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:10:23,080 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2018-11-10 08:10:23,080 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:10:23,080 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:10:23,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,279 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,402 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:23,697 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 08:10:25,971 WARN L179 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2018-11-10 08:10:26,034 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:10:26,034 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,044 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,044 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,065 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,065 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,068 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,068 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post13=0} Honda state: {ULTIMATE.start_check_#t~post13=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 116 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 116 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,094 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,094 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,121 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,121 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,123 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,123 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,142 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,142 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,145 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,145 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post17=0} Honda state: {ULTIMATE.start_check_#t~post17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,168 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,168 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,190 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,190 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,195 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,196 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=0} Honda state: {ULTIMATE.start_check_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,217 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,217 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,245 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,245 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,264 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,267 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,267 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___6~0=0} Honda state: {ULTIMATE.start_check_~tmp___6~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,291 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,291 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,316 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,316 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,341 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,341 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,344 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,344 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_23=-1} Honda state: {v_rep#funAddr~voter.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,375 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,375 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,377 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,377 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___12~0=0} Honda state: {ULTIMATE.start_check_~tmp___12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 128 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,397 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,397 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,399 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,399 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret19=0} Honda state: {ULTIMATE.start_check_#t~ret19=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,418 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,420 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,420 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite28=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite28=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,445 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,445 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,447 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,447 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___5~0=0} Honda state: {ULTIMATE.start_check_~tmp___5~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,484 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,485 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_23=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_23=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,489 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,492 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,492 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,511 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,511 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,513 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,513 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___2~2=0} Honda state: {ULTIMATE.start_check_~tmp___2~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 134 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,534 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,534 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,558 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,558 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,560 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,560 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~next_state~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,579 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,579 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,582 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,582 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_23=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,600 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,603 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,603 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___1~2=0} Honda state: {ULTIMATE.start_check_~tmp___1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,621 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,623 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,623 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,642 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,642 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,650 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,651 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,669 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,669 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,671 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,671 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,690 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,692 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,692 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret9=0} Honda state: {ULTIMATE.start_check_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 142 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 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,711 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,730 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,730 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_int8_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 143 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 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,732 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,733 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,735 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,735 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 144 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 144 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,753 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,753 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,772 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,772 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 145 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 145 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,774 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,774 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,776 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,776 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-10 08:10:26,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,802 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,821 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,821 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_write_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 147 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 147 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,826 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,826 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret12=0} Honda state: {ULTIMATE.start_check_#t~ret12=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 148 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 148 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,847 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,847 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate1_each_pals_period.base_23=-1} Honda state: {v_rep#funAddr~gate1_each_pals_period.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 149 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 149 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,870 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,873 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,873 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 150 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 150 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,891 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,906 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_~buf=128, ~gate3Failed_History_1~0=128, ~gate3Failed_History_2~0=128, ~gate3Failed_History_0~0=128, ~gate3Failed~0=128, ULTIMATE.start_write_history_bool_#in~buf=128} Honda state: {ULTIMATE.start_write_history_bool_~buf=128, ~gate3Failed_History_1~0=128, ~gate3Failed_History_2~0=128, ~gate3Failed_History_0~0=128, ~gate3Failed~0=128, ULTIMATE.start_write_history_bool_#in~buf=128} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 151 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 151 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,926 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,926 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,928 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,928 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 152 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 152 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,947 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,947 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,950 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,950 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_23=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_23=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 153 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 153 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,969 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,971 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,972 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 154 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 154 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:26,995 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:26,995 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:26,998 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:26,998 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 155 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 155 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:27,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:27,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:27,025 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:27,025 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 156 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 156 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:27,044 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:27,044 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 157 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 157 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:27,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:10:27,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:39,608 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 08:10:39,615 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:10:39,615 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:10:39,615 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:10:39,615 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:10:39,615 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:10:39,615 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:39,615 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:10:39,616 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:10:39,616 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2018-11-10 08:10:39,616 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:10:39,616 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:10:39,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,844 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-10 08:10:39,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,855 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:39,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:40,238 WARN L179 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-10 08:10:42,545 WARN L179 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2018-11-10 08:10:42,573 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:10:42,573 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:10:42,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,574 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,574 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,575 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,576 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,577 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,577 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,578 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,579 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,579 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,580 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,581 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,581 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,582 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,583 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,583 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,583 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,584 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,584 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,586 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,587 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,590 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:42,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:42,592 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,593 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,593 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,594 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,594 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,596 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:42,596 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:42,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,597 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,597 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,598 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,598 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,599 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,600 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,602 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,603 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,603 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,603 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,603 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,604 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,604 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,605 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,607 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,607 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,608 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,609 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,609 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,609 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,610 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,611 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,611 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,611 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,612 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,615 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,615 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,616 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,617 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,617 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,620 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,621 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:42,622 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:42,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:42,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:42,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,630 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:42,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:42,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,633 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,640 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,642 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,643 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,651 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,652 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,652 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,653 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,654 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,713 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,715 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,717 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:10:42,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:10:42,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,836 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,952 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:42,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:42,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:42,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:42,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:42,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:42,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:42,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:42,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:42,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:43,090 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:43,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:43,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:43,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:43,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:43,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:43,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:43,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:43,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:43,092 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:43,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:43,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:43,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:43,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:43,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:10:43,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:43,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:10:43,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:43,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:10:43,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:10:43,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:10:43,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:10:43,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:10:43,095 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-11-10 08:10:43,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:10:43,103 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 08:10:43,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:10:43,150 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:10:43,214 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:10:43,215 INFO L444 ModelExtractionUtils]: 16 out of 21 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-10 08:10:43,215 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:10:43,235 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:10:43,235 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:10:43,235 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_read_history_int8_#res, ~nomsg~0, ~g1v_old~0) = -1*ULTIMATE.start_read_history_int8_#res + 1*~nomsg~0 - 1*~g1v_old~0 Supporting invariants [] [2018-11-10 08:10:43,236 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:10:43,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:43,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:43,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:43,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:10:43,724 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-11-10 08:10:43,724 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 2148 states and 2884 transitions. cyclomatic complexity: 744 Second operand 14 states. [2018-11-10 08:10:44,586 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 2148 states and 2884 transitions. cyclomatic complexity: 744. Second operand 14 states. Result 9799 states and 13057 transitions. Complement of second has 37 states. [2018-11-10 08:10:44,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 19 states 1 stem states 17 non-accepting loop states 1 accepting loop states [2018-11-10 08:10:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-10 08:10:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1377 transitions. [2018-11-10 08:10:44,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1377 transitions. Stem has 106 letters. Loop has 53 letters. [2018-11-10 08:10:44,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:10:44,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1377 transitions. Stem has 159 letters. Loop has 53 letters. [2018-11-10 08:10:44,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:10:44,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1377 transitions. Stem has 106 letters. Loop has 106 letters. [2018-11-10 08:10:44,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:10:44,587 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9799 states and 13057 transitions. [2018-11-10 08:10:44,605 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1302 [2018-11-10 08:10:44,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9799 states to 7244 states and 9719 transitions. [2018-11-10 08:10:44,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5004 [2018-11-10 08:10:44,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5164 [2018-11-10 08:10:44,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7244 states and 9719 transitions. [2018-11-10 08:10:44,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:44,617 INFO L705 BuchiCegarLoop]: Abstraction has 7244 states and 9719 transitions. [2018-11-10 08:10:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7244 states and 9719 transitions. [2018-11-10 08:10:44,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7244 to 4667. [2018-11-10 08:10:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4667 states. [2018-11-10 08:10:44,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 6251 transitions. [2018-11-10 08:10:44,672 INFO L728 BuchiCegarLoop]: Abstraction has 4667 states and 6251 transitions. [2018-11-10 08:10:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:10:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:10:44,672 INFO L87 Difference]: Start difference. First operand 4667 states and 6251 transitions. Second operand 3 states. [2018-11-10 08:10:44,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:10:44,748 INFO L93 Difference]: Finished difference Result 3667 states and 4888 transitions. [2018-11-10 08:10:44,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:10:44,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3667 states and 4888 transitions. [2018-11-10 08:10:44,762 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1226 [2018-11-10 08:10:44,769 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3667 states to 3667 states and 4888 transitions. [2018-11-10 08:10:44,770 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2452 [2018-11-10 08:10:44,771 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2452 [2018-11-10 08:10:44,771 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3667 states and 4888 transitions. [2018-11-10 08:10:44,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:44,772 INFO L705 BuchiCegarLoop]: Abstraction has 3667 states and 4888 transitions. [2018-11-10 08:10:44,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3667 states and 4888 transitions. [2018-11-10 08:10:44,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3667 to 2148. [2018-11-10 08:10:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2148 states. [2018-11-10 08:10:44,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2148 states to 2148 states and 2880 transitions. [2018-11-10 08:10:44,804 INFO L728 BuchiCegarLoop]: Abstraction has 2148 states and 2880 transitions. [2018-11-10 08:10:44,804 INFO L608 BuchiCegarLoop]: Abstraction has 2148 states and 2880 transitions. [2018-11-10 08:10:44,805 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-11-10 08:10:44,805 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2148 states and 2880 transitions. [2018-11-10 08:10:44,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 651 [2018-11-10 08:10:44,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:10:44,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:10:44,811 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:44,811 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:44,811 INFO L793 eck$LassoCheckResult]: Stem: 115124#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 114891#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 114892#L116-3 assume true; 115262#L116-1 assume !!(add_history_type_~var~0 < 3); 115222#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115057#L171 assume read_history_bool_~history_id == 0; 115058#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 114858#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 115043#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 115044#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 115263#L116-3 assume true; 115264#L116-1 assume !(add_history_type_~var~0 < 3); 115257#L116-4 add_history_type_#res := 1; 115076#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 115077#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 115206#L116-8 assume true; 115278#L116-6 assume !!(add_history_type_~var~0 < 3); 115201#L117-2 assume !(add_history_type_~history_id == 0); 115202#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115265#L171-4 assume !(read_history_bool_~history_id == 0); 115140#L181-4 assume read_history_bool_~history_id == 1; 115141#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 115029#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 114927#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 114928#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 115279#L116-8 assume true; 115280#L116-6 assume !(add_history_type_~var~0 < 3); 115275#L116-9 add_history_type_#res := 1; 115132#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 115067#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 115068#L116-13 assume true; 115237#L116-11 assume !!(add_history_type_~var~0 < 3); 115196#L117-4 assume !(add_history_type_~history_id == 0); 115197#L123-4 assume !(add_history_type_~history_id == 1); 115312#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115283#L171-8 assume !(read_history_bool_~history_id == 0); 115157#L181-8 assume !(read_history_bool_~history_id == 1); 114937#L191-8 assume read_history_bool_~history_id == 2; 114939#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 115046#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 114903#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 114904#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 115290#L116-13 assume true; 115243#L116-11 assume !(add_history_type_~var~0 < 3); 115235#L116-14 add_history_type_#res := 1; 115127#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 114871#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 114872#L116-18 assume true; 115353#L116-16 assume !!(add_history_type_~var~0 < 3); 115184#L117-6 assume !(add_history_type_~history_id == 0); 115185#L123-6 assume !(add_history_type_~history_id == 1); 115297#L129-6 assume !(add_history_type_~history_id == 2); 115021#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115022#L151-3 assume read_history_int8_~history_id == 3; 115030#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 115032#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 115038#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 115017#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 115018#L116-18 assume true; 115251#L116-16 assume !(add_history_type_~var~0 < 3); 115250#L116-19 add_history_type_#res := 1; 115125#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 115126#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 115073#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 115074#L558-3 assume true; 115779#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 116101#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 116099#L236-2 assume { :end_inline_write_history_bool } true; 116097#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 116094#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 115069#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 115070#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 115260#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 115188#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 115053#L226-2 assume !(write_history_bool_~history_id == 0); 115054#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 115082#L236-5 assume { :end_inline_write_history_bool } true; 115148#L421 assume ~gate2Failed~0 % 256 != 0; 115003#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 114943#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 114944#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 115134#L226-4 assume !(write_history_bool_~history_id == 0); 115128#L231-4 assume !(write_history_bool_~history_id == 1); 115129#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 115136#L236-8 assume { :end_inline_write_history_bool } true; 115161#L452 assume ~gate3Failed~0 % 256 != 0; 115217#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 115192#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 115193#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 115286#L486 assume ~VALUE1~0 == ~VALUE2~0; 117001#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 116999#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 115352#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 115345#L211-2 assume { :end_inline_write_history_int8 } true; 115319#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 115320#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 116796#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 116792#L171-12 assume read_history_bool_~history_id == 0; 116790#L172-12 assume !(read_history_bool_~historyIndex == 0); 116789#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 116785#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 114897#L307 assume !(check_~tmp___3~0 % 256 == 0); 114898#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 114907#L151-7 assume read_history_int8_~history_id == 3; 114959#L152-7 assume !(read_history_int8_~historyIndex == 0); 114960#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 114963#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 114964#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115181#L151-8 [2018-11-10 08:10:44,811 INFO L795 eck$LassoCheckResult]: Loop: 115181#L151-8 assume read_history_int8_~history_id == 3; 114955#L152-8 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 114956#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 114958#L348 assume check_~tmp___6~0 == ~nomsg~0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 115227#L171-15 assume read_history_bool_~history_id == 0; 115236#L172-15 assume !(read_history_bool_~historyIndex == 0); 115348#L175-15 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 115899#L203-15 check_#t~ret20 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___7~0 := check_#t~ret20;havoc check_#t~ret20; 115867#L350 assume !(check_~tmp___7~0 % 256 != 0);check_#res := 0; 115866#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 115865#L583-72 assume !(assert_~arg % 256 == 0); 115859#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 115856#L558-3 assume true; 115778#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 115772#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 115770#L236-2 assume { :end_inline_write_history_bool } true; 115754#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 115714#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 115715#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 116924#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 116923#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 116922#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 116921#L226-2 assume !(write_history_bool_~history_id == 0); 116451#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 116448#L236-5 assume { :end_inline_write_history_bool } true; 116446#L421 assume ~gate2Failed~0 % 256 != 0; 116447#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 116458#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 116456#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 116416#L226-4 assume !(write_history_bool_~history_id == 0); 116402#L231-4 assume !(write_history_bool_~history_id == 1); 116372#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 116336#L236-8 assume { :end_inline_write_history_bool } true; 116323#L452 assume ~gate3Failed~0 % 256 != 0; 116324#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 116984#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 116983#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 116981#L486 assume ~VALUE1~0 == ~VALUE2~0; 116980#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 114887#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 116979#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 116978#L211-2 assume { :end_inline_write_history_int8 } true; 116977#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 116260#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 116257#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 116254#L171-12 assume read_history_bool_~history_id == 0; 116252#L172-12 assume !(read_history_bool_~historyIndex == 0); 116250#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 116247#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 116246#L307 assume !(check_~tmp___3~0 % 256 == 0); 115931#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115930#L151-7 assume read_history_int8_~history_id == 3; 115929#L152-7 assume !(read_history_int8_~historyIndex == 0); 115928#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 115927#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 115926#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 115181#L151-8 [2018-11-10 08:10:44,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:44,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034420, now seen corresponding path program 1 times [2018-11-10 08:10:44,812 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:44,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:44,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:44,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:10:44,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:44,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:10:44,933 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:10:44,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:45,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:45,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:45,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:45,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:10:45,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-11-10 08:10:45,109 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:10:45,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:45,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1488773560, now seen corresponding path program 1 times [2018-11-10 08:10:45,109 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:45,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:45,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:45,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:45,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:45,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:10:45,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:10:45,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:10:45,170 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:10:45,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 08:10:45,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 08:10:45,171 INFO L87 Difference]: Start difference. First operand 2148 states and 2880 transitions. cyclomatic complexity: 740 Second operand 4 states. [2018-11-10 08:10:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:10:45,198 INFO L93 Difference]: Finished difference Result 2044 states and 2666 transitions. [2018-11-10 08:10:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:10:45,199 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2044 states and 2666 transitions. [2018-11-10 08:10:45,202 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 583 [2018-11-10 08:10:45,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2044 states to 1932 states and 2540 transitions. [2018-11-10 08:10:45,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1260 [2018-11-10 08:10:45,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1260 [2018-11-10 08:10:45,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1932 states and 2540 transitions. [2018-11-10 08:10:45,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:45,204 INFO L705 BuchiCegarLoop]: Abstraction has 1932 states and 2540 transitions. [2018-11-10 08:10:45,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states and 2540 transitions. [2018-11-10 08:10:45,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1932. [2018-11-10 08:10:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1932 states. [2018-11-10 08:10:45,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2540 transitions. [2018-11-10 08:10:45,213 INFO L728 BuchiCegarLoop]: Abstraction has 1932 states and 2540 transitions. [2018-11-10 08:10:45,213 INFO L608 BuchiCegarLoop]: Abstraction has 1932 states and 2540 transitions. [2018-11-10 08:10:45,213 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-11-10 08:10:45,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1932 states and 2540 transitions. [2018-11-10 08:10:45,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 583 [2018-11-10 08:10:45,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:10:45,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:10:45,216 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:45,216 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:45,217 INFO L793 eck$LassoCheckResult]: Stem: 119635#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 119414#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119415#L116-3 assume true; 119757#L116-1 assume !!(add_history_type_~var~0 < 3); 119726#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 119573#L171 assume read_history_bool_~history_id == 0; 119574#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 119389#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 119563#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 119564#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 119758#L116-3 assume true; 119759#L116-1 assume !(add_history_type_~var~0 < 3); 119754#L116-4 add_history_type_#res := 1; 119590#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 119591#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119711#L116-8 assume true; 119767#L116-6 assume !!(add_history_type_~var~0 < 3); 119707#L117-2 assume !(add_history_type_~history_id == 0); 119708#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 119760#L171-4 assume !(read_history_bool_~history_id == 0); 119649#L181-4 assume read_history_bool_~history_id == 1; 119650#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 119550#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 119449#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 119450#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 119768#L116-8 assume true; 119769#L116-6 assume !(add_history_type_~var~0 < 3); 119766#L116-9 add_history_type_#res := 1; 119643#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 119582#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119583#L116-13 assume true; 119843#L116-11 assume !!(add_history_type_~var~0 < 3); 119701#L117-4 assume !(add_history_type_~history_id == 0); 119702#L123-4 assume !(add_history_type_~history_id == 1); 119794#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 119770#L171-8 assume !(read_history_bool_~history_id == 0); 119662#L181-8 assume !(read_history_bool_~history_id == 1); 119459#L191-8 assume read_history_bool_~history_id == 2; 119460#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 119664#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 119429#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 119430#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 119740#L116-13 assume true; 119741#L116-11 assume !(add_history_type_~var~0 < 3); 119736#L116-14 add_history_type_#res := 1; 119638#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 119398#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 119399#L116-18 assume true; 119749#L116-16 assume !!(add_history_type_~var~0 < 3); 119689#L117-6 assume !(add_history_type_~history_id == 0); 119690#L123-6 assume !(add_history_type_~history_id == 1); 119783#L129-6 assume !(add_history_type_~history_id == 2); 119541#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 119542#L151-3 assume read_history_int8_~history_id == 3; 119551#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 119553#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 119559#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 119537#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 119538#L116-18 assume true; 119751#L116-16 assume !(add_history_type_~var~0 < 3); 119748#L116-19 add_history_type_#res := 1; 119636#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 119637#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 119588#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 119589#L558-3 assume true; 119821#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 119822#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 120285#L236-2 assume { :end_inline_write_history_bool } true; 120284#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 120282#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 120283#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 121054#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 121051#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 121048#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121044#L226-2 assume !(write_history_bool_~history_id == 0); 121041#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 121036#L236-5 assume { :end_inline_write_history_bool } true; 121032#L421 assume ~gate2Failed~0 % 256 != 0; 121033#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 121038#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 121035#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121031#L226-4 assume !(write_history_bool_~history_id == 0); 121026#L231-4 assume !(write_history_bool_~history_id == 1); 121024#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 121020#L236-8 assume { :end_inline_write_history_bool } true; 121016#L452 assume ~gate3Failed~0 % 256 != 0; 121013#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 121009#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 121005#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 120999#L486 assume ~VALUE1~0 == ~VALUE2~0; 120977#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 120970#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 120964#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 120956#L211-2 assume { :end_inline_write_history_int8 } true; 120949#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 120852#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 120846#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 120840#L171-12 assume read_history_bool_~history_id == 0; 120841#L172-12 assume !(read_history_bool_~historyIndex == 0); 120819#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 120809#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 120424#L307 assume !(check_~tmp___3~0 % 256 == 0); 120375#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120366#L151-7 assume read_history_int8_~history_id == 3; 120364#L152-7 assume !(read_history_int8_~historyIndex == 0); 120362#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 120360#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 120358#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120352#L151-8 [2018-11-10 08:10:45,460 INFO L795 eck$LassoCheckResult]: Loop: 120352#L151-8 assume read_history_int8_~history_id == 3; 120410#L152-8 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 120409#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 120351#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 120350#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120349#L151-9 assume read_history_int8_~history_id == 3; 120291#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 119723#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 120288#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 119548#L366-1 check_#res := 1; 120342#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 120341#L583-72 assume !(assert_~arg % 256 == 0); 120340#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 120339#L558-3 assume true; 120338#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 119576#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 119577#L236-2 assume { :end_inline_write_history_bool } true; 119678#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 120233#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 120234#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 121182#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 121180#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 121178#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121175#L226-2 assume !(write_history_bool_~history_id == 0); 121172#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 121170#L236-5 assume { :end_inline_write_history_bool } true; 121167#L421 assume ~gate2Failed~0 % 256 != 0; 121165#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 121163#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 121161#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 121159#L226-4 assume !(write_history_bool_~history_id == 0); 121157#L231-4 assume !(write_history_bool_~history_id == 1); 121156#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 121155#L236-8 assume { :end_inline_write_history_bool } true; 121153#L452 assume ~gate3Failed~0 % 256 != 0; 121154#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 121273#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 121271#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 121268#L486 assume ~VALUE1~0 == ~VALUE2~0; 121269#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 119410#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 121290#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 121288#L211-2 assume { :end_inline_write_history_int8 } true; 121285#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 121210#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 121208#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 121204#L171-12 assume read_history_bool_~history_id == 0; 121202#L172-12 assume !(read_history_bool_~historyIndex == 0); 121199#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 121193#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 120440#L307 assume !(check_~tmp___3~0 % 256 == 0); 120435#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120432#L151-7 assume read_history_int8_~history_id == 3; 120426#L152-7 assume !(read_history_int8_~historyIndex == 0); 119724#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 119725#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 120295#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 120352#L151-8 [2018-11-10 08:10:45,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:45,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034420, now seen corresponding path program 2 times [2018-11-10 08:10:45,466 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:45,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:45,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:45,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:45,607 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:45,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:10:45,607 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:10:45,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:10:45,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:10:45,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:10:45,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:45,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:45,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:10:45,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-11-10 08:10:45,712 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:10:45,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:45,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1049986076, now seen corresponding path program 1 times [2018-11-10 08:10:45,712 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:45,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:45,713 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:10:45,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:45,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:10:45,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:10:45,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-10 08:10:45,738 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:10:45,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-10 08:10:45,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-10 08:10:45,738 INFO L87 Difference]: Start difference. First operand 1932 states and 2540 transitions. cyclomatic complexity: 616 Second operand 7 states. [2018-11-10 08:10:46,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:10:46,013 INFO L93 Difference]: Finished difference Result 7115 states and 9439 transitions. [2018-11-10 08:10:46,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-10 08:10:46,013 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7115 states and 9439 transitions. [2018-11-10 08:10:46,032 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3209 [2018-11-10 08:10:46,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7115 states to 7115 states and 9439 transitions. [2018-11-10 08:10:46,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5174 [2018-11-10 08:10:46,045 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5174 [2018-11-10 08:10:46,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7115 states and 9439 transitions. [2018-11-10 08:10:46,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:46,045 INFO L705 BuchiCegarLoop]: Abstraction has 7115 states and 9439 transitions. [2018-11-10 08:10:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7115 states and 9439 transitions. [2018-11-10 08:10:46,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7115 to 1936. [2018-11-10 08:10:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2018-11-10 08:10:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2546 transitions. [2018-11-10 08:10:46,075 INFO L728 BuchiCegarLoop]: Abstraction has 1936 states and 2546 transitions. [2018-11-10 08:10:46,075 INFO L608 BuchiCegarLoop]: Abstraction has 1936 states and 2546 transitions. [2018-11-10 08:10:46,075 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-11-10 08:10:46,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1936 states and 2546 transitions. [2018-11-10 08:10:46,079 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 597 [2018-11-10 08:10:46,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:10:46,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:10:46,080 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:46,080 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:46,080 INFO L793 eck$LassoCheckResult]: Stem: 129055#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 128819#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 128820#L116-3 assume true; 129191#L116-1 assume !!(add_history_type_~var~0 < 3); 129152#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 128984#L171 assume read_history_bool_~history_id == 0; 128985#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 128794#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 128974#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 128975#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 129192#L116-3 assume true; 129193#L116-1 assume !(add_history_type_~var~0 < 3); 129188#L116-4 add_history_type_#res := 1; 129003#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 129004#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 129135#L116-8 assume true; 129200#L116-6 assume !!(add_history_type_~var~0 < 3); 129131#L117-2 assume !(add_history_type_~history_id == 0); 129132#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 129194#L171-4 assume !(read_history_bool_~history_id == 0); 129070#L181-4 assume read_history_bool_~history_id == 1; 129071#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 128961#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 128855#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 128856#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 129201#L116-8 assume true; 129202#L116-6 assume !(add_history_type_~var~0 < 3); 129199#L116-9 add_history_type_#res := 1; 129063#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 128993#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 128994#L116-13 assume true; 129296#L116-11 assume !!(add_history_type_~var~0 < 3); 129126#L117-4 assume !(add_history_type_~history_id == 0); 129128#L123-4 assume !(add_history_type_~history_id == 1); 129239#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 129203#L171-8 assume !(read_history_bool_~history_id == 0); 129086#L181-8 assume !(read_history_bool_~history_id == 1); 128865#L191-8 assume read_history_bool_~history_id == 2; 128866#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 129088#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 128831#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 128832#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 129172#L116-13 assume true; 129173#L116-11 assume !(add_history_type_~var~0 < 3); 129166#L116-14 add_history_type_#res := 1; 129058#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 128803#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 128804#L116-18 assume true; 129287#L116-16 assume !!(add_history_type_~var~0 < 3); 129114#L117-6 assume !(add_history_type_~history_id == 0); 129116#L123-6 assume !(add_history_type_~history_id == 1); 129224#L129-6 assume !(add_history_type_~history_id == 2); 128951#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 128952#L151-3 assume read_history_int8_~history_id == 3; 128962#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 128964#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 128970#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 128947#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 128948#L116-18 assume true; 129182#L116-16 assume !(add_history_type_~var~0 < 3); 129181#L116-19 add_history_type_#res := 1; 129056#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 129057#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 128999#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 129000#L558-3 assume true; 129592#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 129780#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 129779#L236-2 assume { :end_inline_write_history_bool } true; 129778#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 129776#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 129777#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 130345#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 130344#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 130343#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130342#L226-2 assume !(write_history_bool_~history_id == 0); 130341#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 130339#L236-5 assume { :end_inline_write_history_bool } true; 130337#L421 assume ~gate2Failed~0 % 256 != 0; 130338#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 130336#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 130332#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130330#L226-4 assume !(write_history_bool_~history_id == 0); 130328#L231-4 assume !(write_history_bool_~history_id == 1); 130326#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 130324#L236-8 assume { :end_inline_write_history_bool } true; 130319#L452 assume ~gate3Failed~0 % 256 != 0; 130316#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 130313#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 130310#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 130305#L486 assume ~VALUE1~0 == ~VALUE2~0; 130301#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 130295#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 130149#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 130137#L211-2 assume { :end_inline_write_history_int8 } true; 130132#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 130125#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 130119#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 130117#L171-12 assume read_history_bool_~history_id == 0; 130106#L172-12 assume !(read_history_bool_~historyIndex == 0); 130095#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 130086#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 130078#L307 assume !(check_~tmp___3~0 % 256 == 0); 130069#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 129221#L151-7 assume read_history_int8_~history_id == 3; 129222#L152-7 assume !(read_history_int8_~historyIndex == 0); 129150#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 129151#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 129111#L346 assume !(check_~tmp___10~0 > -2); 129112#L346-1 [2018-11-10 08:10:46,081 INFO L795 eck$LassoCheckResult]: Loop: 129112#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 129256#L151-9 assume read_history_int8_~history_id == 3; 129257#L152-9 assume !(read_history_int8_~historyIndex == 0); 128874#L155-9 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 128875#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 129904#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 128959#L366-1 check_#res := 1; 128942#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 128943#L583-72 assume !(assert_~arg % 256 == 0); 129133#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 129153#L558-3 assume true; 129889#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 129886#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 129885#L236-2 assume { :end_inline_write_history_bool } true; 129884#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 129880#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 129881#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 130548#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 130545#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 130541#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130539#L226-2 assume !(write_history_bool_~history_id == 0); 130537#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 130534#L236-5 assume { :end_inline_write_history_bool } true; 130531#L421 assume ~gate2Failed~0 % 256 != 0; 130532#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 130645#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 130640#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 130634#L226-4 assume !(write_history_bool_~history_id == 0); 130632#L231-4 assume !(write_history_bool_~history_id == 1); 130631#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 130630#L236-8 assume { :end_inline_write_history_bool } true; 130629#L452 assume ~gate3Failed~0 % 256 != 0; 130626#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 130623#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 130621#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 130618#L486 assume ~VALUE1~0 == ~VALUE2~0; 130614#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 130205#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 130442#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 129878#L211-2 assume { :end_inline_write_history_int8 } true; 129877#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 129807#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 129805#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 129803#L171-12 assume read_history_bool_~history_id == 0; 129801#L172-12 assume !(read_history_bool_~historyIndex == 0); 129799#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 129798#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 129793#L307 assume !(check_~tmp___3~0 % 256 == 0); 128826#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 128835#L151-7 assume read_history_int8_~history_id == 3; 128886#L152-7 assume !(read_history_int8_~historyIndex == 0); 128887#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 128890#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 128891#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 129113#L151-8 assume read_history_int8_~history_id == 3; 128881#L152-8 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 128882#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 129156#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 129112#L346-1 [2018-11-10 08:10:46,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:46,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034201, now seen corresponding path program 1 times [2018-11-10 08:10:46,081 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:46,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:46,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:46,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:10:46,120 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:10:46,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:46,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:46,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:10:46,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 08:10:46,205 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:10:46,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:46,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1644533277, now seen corresponding path program 1 times [2018-11-10 08:10:46,205 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:46,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:46,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:10:46,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:10:46,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 08:10:46,215 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 08:10:46,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 08:10:46,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 08:10:46,215 INFO L87 Difference]: Start difference. First operand 1936 states and 2546 transitions. cyclomatic complexity: 618 Second operand 3 states. [2018-11-10 08:10:46,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:10:46,235 INFO L93 Difference]: Finished difference Result 1894 states and 2404 transitions. [2018-11-10 08:10:46,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 08:10:46,235 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1894 states and 2404 transitions. [2018-11-10 08:10:46,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 573 [2018-11-10 08:10:46,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1894 states to 1894 states and 2404 transitions. [2018-11-10 08:10:46,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1232 [2018-11-10 08:10:46,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1232 [2018-11-10 08:10:46,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1894 states and 2404 transitions. [2018-11-10 08:10:46,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:10:46,242 INFO L705 BuchiCegarLoop]: Abstraction has 1894 states and 2404 transitions. [2018-11-10 08:10:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states and 2404 transitions. [2018-11-10 08:10:46,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1884. [2018-11-10 08:10:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1884 states. [2018-11-10 08:10:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 2394 transitions. [2018-11-10 08:10:46,251 INFO L728 BuchiCegarLoop]: Abstraction has 1884 states and 2394 transitions. [2018-11-10 08:10:46,251 INFO L608 BuchiCegarLoop]: Abstraction has 1884 states and 2394 transitions. [2018-11-10 08:10:46,251 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-11-10 08:10:46,251 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1884 states and 2394 transitions. [2018-11-10 08:10:46,253 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 571 [2018-11-10 08:10:46,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:10:46,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:10:46,253 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:46,253 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:10:46,254 INFO L793 eck$LassoCheckResult]: Stem: 133190#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 132979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 132980#L116-3 assume true; 133320#L116-1 assume !!(add_history_type_~var~0 < 3); 133285#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 133124#L171 assume read_history_bool_~history_id == 0; 133125#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 132956#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 133114#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 133115#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 133321#L116-3 assume true; 133322#L116-1 assume !(add_history_type_~var~0 < 3); 133317#L116-4 add_history_type_#res := 1; 133141#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 133142#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 133267#L116-8 assume true; 133332#L116-6 assume !!(add_history_type_~var~0 < 3); 133262#L117-2 assume !(add_history_type_~history_id == 0); 133263#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 133323#L171-4 assume !(read_history_bool_~history_id == 0); 133204#L181-4 assume read_history_bool_~history_id == 1; 133205#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 133103#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 133014#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 133015#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 133333#L116-8 assume true; 133334#L116-6 assume !(add_history_type_~var~0 < 3); 133331#L116-9 add_history_type_#res := 1; 133198#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 133133#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 133134#L116-13 assume true; 133415#L116-11 assume !!(add_history_type_~var~0 < 3); 133257#L117-4 assume !(add_history_type_~history_id == 0); 133259#L123-4 assume !(add_history_type_~history_id == 1); 133359#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 133335#L171-8 assume !(read_history_bool_~history_id == 0); 133218#L181-8 assume !(read_history_bool_~history_id == 1); 133024#L191-8 assume read_history_bool_~history_id == 2; 133025#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 133220#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 132991#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 132992#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 133301#L116-13 assume true; 133302#L116-11 assume !(add_history_type_~var~0 < 3); 133296#L116-14 add_history_type_#res := 1; 133193#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 132963#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 132964#L116-18 assume true; 133407#L116-16 assume !!(add_history_type_~var~0 < 3); 133245#L117-6 assume !(add_history_type_~history_id == 0); 133247#L123-6 assume !(add_history_type_~history_id == 1); 133350#L129-6 assume !(add_history_type_~history_id == 2); 133094#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133095#L151-3 assume read_history_int8_~history_id == 3; 133104#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 133105#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 133110#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 133090#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 133091#L116-18 assume true; 133311#L116-16 assume !(add_history_type_~var~0 < 3); 133310#L116-19 add_history_type_#res := 1; 133191#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 133192#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 133139#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 133140#L558-3 assume true; 133772#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 133766#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 133764#L236-2 assume { :end_inline_write_history_bool } true; 133762#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 133752#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 133753#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 134371#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 134370#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 134369#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134368#L226-2 assume !(write_history_bool_~history_id == 0); 134366#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 134364#L236-5 assume { :end_inline_write_history_bool } true; 134362#L421 assume ~gate2Failed~0 % 256 != 0; 134363#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 134518#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 134515#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134514#L226-4 assume !(write_history_bool_~history_id == 0); 134510#L231-4 assume !(write_history_bool_~history_id == 1); 134508#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 134506#L236-8 assume { :end_inline_write_history_bool } true; 134504#L452 assume ~gate3Failed~0 % 256 != 0; 134502#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 134499#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 134497#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 134494#L486 assume ~VALUE1~0 == ~VALUE2~0; 134492#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 134489#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 134487#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 134484#L211-2 assume { :end_inline_write_history_int8 } true; 134483#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 134259#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 134257#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 134255#L171-12 assume read_history_bool_~history_id == 0; 134253#L172-12 assume !(read_history_bool_~historyIndex == 0); 134251#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 134249#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 134248#L307 assume !(check_~tmp___3~0 % 256 == 0); 132986#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 132995#L151-7 assume read_history_int8_~history_id == 3; 133041#L152-7 assume !(read_history_int8_~historyIndex == 0); 133042#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 133899#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 133895#L346 assume !(check_~tmp___10~0 > -2); 133288#L346-1 [2018-11-10 08:10:46,254 INFO L795 eck$LassoCheckResult]: Loop: 133288#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133910#L151-9 assume read_history_int8_~history_id == 3; 133909#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 133908#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 133907#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133903#L151-10 assume read_history_int8_~history_id == 3; 133906#L152-10 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 133088#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 133089#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 133352#L366-1 check_#res := 1; 133353#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 134240#L583-72 assume !(assert_~arg % 256 == 0); 134239#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 134238#L558-3 assume true; 134236#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134233#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 134232#L236-2 assume { :end_inline_write_history_bool } true; 134231#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 134230#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 134229#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 134228#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 134227#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 134226#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134224#L226-2 assume !(write_history_bool_~history_id == 0); 134222#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 134219#L236-5 assume { :end_inline_write_history_bool } true; 134216#L421 assume ~gate2Failed~0 % 256 != 0; 134217#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 134786#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 134785#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 134626#L226-4 assume !(write_history_bool_~history_id == 0); 134625#L231-4 assume !(write_history_bool_~history_id == 1); 134624#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 134623#L236-8 assume { :end_inline_write_history_bool } true; 134621#L452 assume ~gate3Failed~0 % 256 != 0; 134619#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 134617#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 134616#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 134614#L486 assume ~VALUE1~0 == ~VALUE2~0; 134610#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 134606#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 134604#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 134602#L211-2 assume { :end_inline_write_history_int8 } true; 134600#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 134119#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 134116#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 134112#L171-12 assume read_history_bool_~history_id == 0; 134108#L172-12 assume !(read_history_bool_~historyIndex == 0); 134106#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 134103#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 133936#L307 assume !(check_~tmp___3~0 % 256 == 0); 133924#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133921#L151-7 assume read_history_int8_~history_id == 3; 133913#L152-7 assume !(read_history_int8_~historyIndex == 0); 133282#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 133045#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 133046#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 133896#L151-8 assume read_history_int8_~history_id == 3; 133038#L152-8 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 133039#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 133040#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 133288#L346-1 [2018-11-10 08:10:46,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:46,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1723034201, now seen corresponding path program 2 times [2018-11-10 08:10:46,254 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:46,254 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:10:46,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:10:46,291 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:46,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:10:46,291 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:10:46,306 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-10 08:10:46,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-10 08:10:46,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 08:10:46,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:10:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 08:10:46,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:10:46,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-10 08:10:46,409 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:10:46,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:10:46,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1226239372, now seen corresponding path program 1 times [2018-11-10 08:10:46,410 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:10:46,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:10:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 08:10:46,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:10:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:10:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:10:47,130 WARN L179 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 281 DAG size of output: 244 [2018-11-10 08:10:48,758 WARN L179 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 189 DAG size of output: 170 [2018-11-10 08:10:48,759 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:10:48,759 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:10:48,759 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:10:48,760 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:10:48,760 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:10:48,760 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:48,760 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:10:48,760 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:10:48,760 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration30_Loop [2018-11-10 08:10:48,760 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:10:48,760 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:10:48,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:48,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,017 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-10 08:10:49,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,039 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:10:49,370 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 08:10:49,415 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:10:58,094 WARN L179 SmtUtils]: Spent 8.58 s on a formula simplification. DAG size of input: 260 DAG size of output: 156 [2018-11-10 08:10:58,123 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:10:58,124 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 162 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 162 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,133 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,133 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,136 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,136 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet33=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 163 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 163 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,156 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,156 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,158 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,158 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Honda state: {ULTIMATE.start_assert_#in~arg=1, ULTIMATE.start_assert_~arg=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 164 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 164 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,190 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,190 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,192 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,192 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 165 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 165 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,212 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,212 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,214 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,214 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 166 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 166 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,233 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,233 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 167 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 167 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,251 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,251 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post17=0} Honda state: {ULTIMATE.start_check_#t~post17=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 168 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 168 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,270 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,271 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 169 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 169 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,295 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,295 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,296 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,296 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret22=0} Honda state: {ULTIMATE.start_check_#t~ret22=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 170 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 170 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,313 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,313 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,315 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,315 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 171 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 171 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,333 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,334 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_25=-1} Honda state: {v_rep#funAddr~voter.base_25=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 172 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 172 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,350 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,374 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,375 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_25=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_25=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 173 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 173 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,378 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,379 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_~tmp~5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 174 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 174 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,395 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,395 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,397 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,397 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 175 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 175 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,413 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,413 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,430 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,430 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 176 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 176 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,433 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:10:58,458 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:10:58,459 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_25=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_25=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 177 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 177 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,461 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:10:58,461 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 178 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 178 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:10:58,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:10:58,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:10,554 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 08:11:10,558 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:11:10,558 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:11:10,558 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:11:10,558 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:11:10,558 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:11:10,558 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:10,558 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:11:10,558 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:11:10,558 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration30_Loop [2018-11-10 08:11:10,558 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:11:10,558 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:11:10,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,693 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-11-10 08:11:10,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,809 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:10,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:11,035 WARN L179 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-11-10 08:11:11,231 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:11:19,473 WARN L179 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 260 DAG size of output: 156 [2018-11-10 08:11:19,584 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:11:19,585 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:11:19,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,585 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,586 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,586 INFO L206 nArgumentSynthesizer]: 24 loop disjuncts [2018-11-10 08:11:19,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,599 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-10 08:11:19,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,723 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,725 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,728 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,734 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:19,734 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:19,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,740 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,743 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,745 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,747 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,759 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,764 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:19,768 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:19,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:19,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:19,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:19,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:19,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,775 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:19,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:19,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,779 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,780 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,785 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,785 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,786 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,787 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,787 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,788 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,788 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,788 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:19,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:19,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:19,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:19,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:19,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:19,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:19,790 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:19,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:19,790 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:11:19,791 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:11:19,791 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:11:19,792 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:11:19,792 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:11:19,792 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:11:19,792 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 08:11:19,873 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:11:19,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:11:19,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:19,936 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:11:20,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:20,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:11:20,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:11:20,061 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:11:20,061 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1884 states and 2394 transitions. cyclomatic complexity: 518 Second operand 5 states. [2018-11-10 08:11:20,121 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1884 states and 2394 transitions. cyclomatic complexity: 518. Second operand 5 states. Result 4819 states and 6097 transitions. Complement of second has 6 states. [2018-11-10 08:11:20,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:11:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:11:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2018-11-10 08:11:20,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 475 transitions. Stem has 108 letters. Loop has 61 letters. [2018-11-10 08:11:20,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:11:20,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 475 transitions. Stem has 169 letters. Loop has 61 letters. [2018-11-10 08:11:20,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:11:20,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 475 transitions. Stem has 108 letters. Loop has 122 letters. [2018-11-10 08:11:20,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:11:20,124 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4819 states and 6097 transitions. [2018-11-10 08:11:20,137 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 571 [2018-11-10 08:11:20,139 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4819 states to 1104 states and 1390 transitions. [2018-11-10 08:11:20,139 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1053 [2018-11-10 08:11:20,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1053 [2018-11-10 08:11:20,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1104 states and 1390 transitions. [2018-11-10 08:11:20,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:11:20,140 INFO L705 BuchiCegarLoop]: Abstraction has 1104 states and 1390 transitions. [2018-11-10 08:11:20,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states and 1390 transitions. [2018-11-10 08:11:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 458. [2018-11-10 08:11:20,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-11-10 08:11:20,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 574 transitions. [2018-11-10 08:11:20,145 INFO L728 BuchiCegarLoop]: Abstraction has 458 states and 574 transitions. [2018-11-10 08:11:20,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:11:20,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:11:20,145 INFO L87 Difference]: Start difference. First operand 458 states and 574 transitions. Second operand 5 states. [2018-11-10 08:11:20,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:11:20,335 INFO L93 Difference]: Finished difference Result 594 states and 738 transitions. [2018-11-10 08:11:20,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 08:11:20,336 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 594 states and 738 transitions. [2018-11-10 08:11:20,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2018-11-10 08:11:20,337 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 594 states to 570 states and 712 transitions. [2018-11-10 08:11:20,337 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 425 [2018-11-10 08:11:20,337 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 425 [2018-11-10 08:11:20,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 570 states and 712 transitions. [2018-11-10 08:11:20,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:11:20,337 INFO L705 BuchiCegarLoop]: Abstraction has 570 states and 712 transitions. [2018-11-10 08:11:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states and 712 transitions. [2018-11-10 08:11:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 485. [2018-11-10 08:11:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-11-10 08:11:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 609 transitions. [2018-11-10 08:11:20,340 INFO L728 BuchiCegarLoop]: Abstraction has 485 states and 609 transitions. [2018-11-10 08:11:20,340 INFO L608 BuchiCegarLoop]: Abstraction has 485 states and 609 transitions. [2018-11-10 08:11:20,340 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-11-10 08:11:20,340 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 485 states and 609 transitions. [2018-11-10 08:11:20,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 286 [2018-11-10 08:11:20,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:11:20,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:11:20,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:11:20,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:11:20,342 INFO L793 eck$LassoCheckResult]: Stem: 141715#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 141578#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141579#L116-3 assume true; 141796#L116-1 assume !!(add_history_type_~var~0 < 3); 141848#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141846#L171 assume read_history_bool_~history_id == 0; 141843#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 141840#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 141838#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 141809#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141797#L116-3 assume true; 141798#L116-1 assume !!(add_history_type_~var~0 < 3); 141775#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141675#L171 assume read_history_bool_~history_id == 0; 141676#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 141564#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 141669#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 141670#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141833#L116-3 assume true; 141800#L116-1 assume !(add_history_type_~var~0 < 3); 141794#L116-4 add_history_type_#res := 1; 141688#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 141689#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141767#L116-8 assume true; 141803#L116-6 assume !!(add_history_type_~var~0 < 3); 142018#L117-2 assume !(add_history_type_~history_id == 0); 142017#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 142016#L171-4 assume !(read_history_bool_~history_id == 0); 142014#L181-4 assume read_history_bool_~history_id == 1; 142012#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 142007#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 142005#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 141815#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141804#L116-8 assume true; 141805#L116-6 assume !!(add_history_type_~var~0 < 3); 141764#L117-2 assume !(add_history_type_~history_id == 0); 141765#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141799#L171-4 assume !(read_history_bool_~history_id == 0); 141725#L181-4 assume read_history_bool_~history_id == 1; 141726#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 141661#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 141602#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 141603#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141834#L116-8 assume true; 141808#L116-6 assume !(add_history_type_~var~0 < 3); 141802#L116-9 add_history_type_#res := 1; 141721#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 141683#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141684#L116-13 assume true; 141782#L116-11 assume !!(add_history_type_~var~0 < 3); 141760#L117-4 assume !(add_history_type_~history_id == 0); 141761#L123-4 assume !(add_history_type_~history_id == 1); 141822#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141807#L171-8 assume !(read_history_bool_~history_id == 0); 141734#L181-8 assume !(read_history_bool_~history_id == 1); 141609#L191-8 assume read_history_bool_~history_id == 2; 141610#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 141737#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 141587#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 141588#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141783#L116-13 assume true; 141784#L116-11 assume !!(add_history_type_~var~0 < 3); 141762#L117-4 assume !(add_history_type_~history_id == 0); 141763#L123-4 assume !(add_history_type_~history_id == 1); 141821#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141806#L171-8 assume !(read_history_bool_~history_id == 0); 141733#L181-8 assume !(read_history_bool_~history_id == 1); 141607#L191-8 assume read_history_bool_~history_id == 2; 141608#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 141735#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 141585#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 141586#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141814#L116-13 assume true; 141787#L116-11 assume !(add_history_type_~var~0 < 3); 141780#L116-14 add_history_type_#res := 1; 141718#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 141569#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 141570#L116-18 assume true; 141832#L116-16 assume !!(add_history_type_~var~0 < 3); 141751#L117-6 assume !(add_history_type_~history_id == 0); 141752#L123-6 assume !(add_history_type_~history_id == 1); 141818#L129-6 assume !(add_history_type_~history_id == 2); 141654#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141655#L151-3 assume read_history_int8_~history_id == 3; 141664#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 141665#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 141667#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 141650#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141651#L116-18 assume true; 141790#L116-16 assume !!(add_history_type_~var~0 < 3); 141753#L117-6 assume !(add_history_type_~history_id == 0); 141754#L123-6 assume !(add_history_type_~history_id == 1); 141817#L129-6 assume !(add_history_type_~history_id == 2); 141652#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141653#L151-3 assume read_history_int8_~history_id == 3; 141662#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 141663#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 141666#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 141648#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 141649#L116-18 assume true; 141789#L116-16 assume !(add_history_type_~var~0 < 3); 141788#L116-19 add_history_type_#res := 1; 141716#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 141717#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 141685#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 141686#L558-3 assume true; 141966#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141963#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 141962#L236-2 assume { :end_inline_write_history_bool } true; 141961#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 141960#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 141958#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 141957#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 141956#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 141955#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141954#L226-2 assume !(write_history_bool_~history_id == 0); 141694#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 141695#L236-5 assume { :end_inline_write_history_bool } true; 141730#L421 assume ~gate2Failed~0 % 256 != 0; 141950#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 141998#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 141997#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141996#L226-4 assume !(write_history_bool_~history_id == 0); 141995#L231-4 assume !(write_history_bool_~history_id == 1); 141994#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 141993#L236-8 assume { :end_inline_write_history_bool } true; 141992#L452 assume ~gate3Failed~0 % 256 != 0; 141991#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 141990#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 141989#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 141988#L486 assume ~VALUE1~0 == ~VALUE2~0; 141987#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 141594#L514-2 [2018-11-10 08:11:20,864 INFO L795 eck$LassoCheckResult]: Loop: 141594#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 141983#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 141975#L211-2 assume { :end_inline_write_history_int8 } true; 141973#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 141894#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 141891#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 141889#L171-12 assume read_history_bool_~history_id == 0; 141888#L172-12 assume !(read_history_bool_~historyIndex == 0); 141887#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 141732#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 141582#L307 assume !(check_~tmp___3~0 % 256 == 0); 141583#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141589#L151-7 assume read_history_int8_~history_id == 3; 141619#L152-7 assume !(read_history_int8_~historyIndex == 0); 141620#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 141621#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 141622#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141750#L151-8 assume read_history_int8_~history_id == 3; 141616#L152-8 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 141617#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 141618#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 141740#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141741#L151-9 assume read_history_int8_~history_id == 3; 141611#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 141612#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 141615#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 141816#L151-10 assume read_history_int8_~history_id == 3; 141643#L152-10 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 141644#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 141645#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 141657#L366-1 check_#res := 1; 141646#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 141647#L583-72 assume !(assert_~arg % 256 == 0); 141766#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 141774#L558-3 assume true; 141829#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141678#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 141679#L236-2 assume { :end_inline_write_history_bool } true; 141744#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 141728#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 141681#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 141682#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 141795#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 141755#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141673#L226-2 assume !(write_history_bool_~history_id == 0); 141674#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 141952#L236-5 assume { :end_inline_write_history_bool } true; 141826#L421 assume ~gate2Failed~0 % 256 != 0; 141641#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 141613#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 141614#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 141723#L226-4 assume !(write_history_bool_~history_id == 0); 141719#L231-4 assume !(write_history_bool_~history_id == 1); 141720#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 141724#L236-8 assume { :end_inline_write_history_bool } true; 141739#L452 assume ~gate3Failed~0 % 256 != 0; 141791#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 141757#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 141758#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 141769#L486 assume !(~VALUE1~0 == ~VALUE2~0); 141770#L493 assume ~VALUE1~0 == ~VALUE3~0; 141986#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 141594#L514-2 [2018-11-10 08:11:21,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:11:21,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1004694626, now seen corresponding path program 1 times [2018-11-10 08:11:21,417 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:11:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:11:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:21,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:11:21,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 08:11:21,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 08:11:21,449 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 179 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 08:11:21,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:11:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:21,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:11:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2018-11-10 08:11:21,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-10 08:11:21,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-10 08:11:21,525 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:11:21,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:11:21,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1753500014, now seen corresponding path program 1 times [2018-11-10 08:11:21,526 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:11:21,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:11:21,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:21,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:11:21,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:11:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:11:22,350 WARN L179 SmtUtils]: Spent 802.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 244 [2018-11-10 08:11:23,396 WARN L179 SmtUtils]: Spent 988.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-11-10 08:11:23,401 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:11:23,401 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:11:23,401 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:11:23,401 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:11:23,401 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:11:23,401 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:23,402 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:11:23,402 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:11:23,402 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration31_Loop [2018-11-10 08:11:23,402 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:11:23,402 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:11:23,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,494 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,495 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:23,687 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-10 08:11:24,099 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 08:11:24,100 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:11:27,694 WARN L179 SmtUtils]: Spent 3.47 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-10 08:11:27,697 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:11:27,697 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 180 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 180 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,701 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,704 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,704 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_27=-1} Honda state: {v_rep#funAddr~voter.base_27=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 181 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 181 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,721 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,721 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,725 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,725 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Honda state: {ULTIMATE.start_read_history_int8_#in~historyIndex=0, ULTIMATE.start_read_history_int8_~historyIndex=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 182 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 182 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,745 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,745 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 183 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 183 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,762 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,762 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,764 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,764 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 184 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 184 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,782 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,783 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,784 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 185 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 185 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,801 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,801 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,803 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,803 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 186 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 186 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,820 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,820 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,822 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,822 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 187 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 187 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,839 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,840 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,857 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,857 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_27=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_27=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 188 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 188 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,877 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,877 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret23=0} Honda state: {ULTIMATE.start_check_#t~ret23=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 189 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 189 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,906 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 190 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 190 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,926 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,926 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 191 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 191 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,951 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,951 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,954 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,954 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Honda state: {ULTIMATE.start_check_#res=1, ULTIMATE.start_main_~c1~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 192 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 192 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,974 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,974 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 193 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 193 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:27,992 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:27,992 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:27,995 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:27,995 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 194 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 194 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,014 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,015 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,015 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret10=0} Honda state: {ULTIMATE.start_check_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 195 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 195 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,033 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,033 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,035 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,035 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite36=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 196 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 196 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,055 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,055 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret26=0} Honda state: {ULTIMATE.start_check_#t~ret26=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 197 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 197 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,080 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,080 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,082 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,082 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 198 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 198 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,107 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,107 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,109 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,109 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 199 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 199 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,137 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,137 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret20=0} Honda state: {ULTIMATE.start_check_#t~ret20=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 200 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 200 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,157 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,157 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret24=0} Honda state: {ULTIMATE.start_check_#t~ret24=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 201 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 201 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,183 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,183 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,185 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,185 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 202 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 202 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,202 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,203 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,205 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,205 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_~tmp___0~4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 203 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 203 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,249 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,249 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp~2=1} Honda state: {ULTIMATE.start_check_~tmp~2=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 204 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 204 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,253 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,253 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,256 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,256 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Honda state: {ULTIMATE.start_read_history_bool_~historyIndex=1, ULTIMATE.start_read_history_bool_#in~historyIndex=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 205 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 205 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,273 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,273 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,276 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,276 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~post15=0} Honda state: {ULTIMATE.start_check_#t~post15=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 206 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 206 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,293 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,293 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,295 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,295 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet27=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 207 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 207 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,312 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,312 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,313 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,314 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 208 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 208 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,331 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:28,333 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:28,333 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_#in~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 209 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 209 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,351 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:28,351 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 210 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 210 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:28,389 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:11:28,389 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:40,425 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 08:11:40,428 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:11:40,428 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:11:40,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:11:40,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:11:40,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:11:40,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:40,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:11:40,428 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:11:40,428 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration31_Loop [2018-11-10 08:11:40,428 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:11:40,428 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:11:40,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,615 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-10 08:11:40,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,693 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,694 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:40,937 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 08:11:41,138 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:11:44,618 WARN L179 SmtUtils]: Spent 3.46 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-10 08:11:44,730 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:11:44,730 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:11:44,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,731 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,733 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,738 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,742 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,744 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,744 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,746 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,747 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,747 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,747 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,747 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,748 INFO L206 nArgumentSynthesizer]: 12 loop disjuncts [2018-11-10 08:11:44,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,760 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-11-10 08:11:44,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,826 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,827 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,828 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,828 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,829 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,829 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,830 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,831 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,831 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,833 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,833 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,834 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,835 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,836 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,836 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,838 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,839 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,840 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,842 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,844 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,848 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,849 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,849 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,849 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,849 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,850 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,850 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,852 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,852 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,852 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,853 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,854 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,855 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,855 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,855 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,856 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,856 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,859 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,859 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,859 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,861 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,863 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,864 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,865 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,865 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,866 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,866 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,868 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:11:44,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:11:44,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,873 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,874 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,875 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,875 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,877 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,878 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,879 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,880 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,924 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,926 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,926 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,926 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:11:44,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:11:44,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:11:44,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:11:44,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:11:44,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:11:44,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:11:44,927 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:11:44,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:11:44,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:11:44,928 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:11:44,928 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:11:44,928 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:11:44,929 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:11:44,929 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:11:44,929 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 08:11:44,929 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:11:45,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:11:45,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:45,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:11:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:45,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:11:45,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:11:45,127 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:11:45,127 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 485 states and 609 transitions. cyclomatic complexity: 129 Second operand 5 states. [2018-11-10 08:11:45,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 485 states and 609 transitions. cyclomatic complexity: 129. Second operand 5 states. Result 1073 states and 1351 transitions. Complement of second has 6 states. [2018-11-10 08:11:45,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:11:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:11:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 473 transitions. [2018-11-10 08:11:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 473 transitions. Stem has 132 letters. Loop has 62 letters. [2018-11-10 08:11:45,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:11:45,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 473 transitions. Stem has 194 letters. Loop has 62 letters. [2018-11-10 08:11:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:11:45,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 473 transitions. Stem has 132 letters. Loop has 124 letters. [2018-11-10 08:11:45,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:11:45,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1073 states and 1351 transitions. [2018-11-10 08:11:45,149 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-10 08:11:45,150 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1073 states to 477 states and 593 transitions. [2018-11-10 08:11:45,150 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 399 [2018-11-10 08:11:45,150 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2018-11-10 08:11:45,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 477 states and 593 transitions. [2018-11-10 08:11:45,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:11:45,151 INFO L705 BuchiCegarLoop]: Abstraction has 477 states and 593 transitions. [2018-11-10 08:11:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states and 593 transitions. [2018-11-10 08:11:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2018-11-10 08:11:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2018-11-10 08:11:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 593 transitions. [2018-11-10 08:11:45,154 INFO L728 BuchiCegarLoop]: Abstraction has 477 states and 593 transitions. [2018-11-10 08:11:45,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 08:11:45,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-10 08:11:45,155 INFO L87 Difference]: Start difference. First operand 477 states and 593 transitions. Second operand 6 states. [2018-11-10 08:11:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:11:45,272 INFO L93 Difference]: Finished difference Result 576 states and 708 transitions. [2018-11-10 08:11:45,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 08:11:45,273 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 708 transitions. [2018-11-10 08:11:45,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-10 08:11:45,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 552 states and 682 transitions. [2018-11-10 08:11:45,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 399 [2018-11-10 08:11:45,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 399 [2018-11-10 08:11:45,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 552 states and 682 transitions. [2018-11-10 08:11:45,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-10 08:11:45,274 INFO L705 BuchiCegarLoop]: Abstraction has 552 states and 682 transitions. [2018-11-10 08:11:45,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states and 682 transitions. [2018-11-10 08:11:45,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 528. [2018-11-10 08:11:45,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-10 08:11:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 656 transitions. [2018-11-10 08:11:45,278 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 656 transitions. [2018-11-10 08:11:45,278 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 656 transitions. [2018-11-10 08:11:45,278 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-11-10 08:11:45,278 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 656 transitions. [2018-11-10 08:11:45,278 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2018-11-10 08:11:45,278 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 08:11:45,278 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 08:11:45,279 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:11:45,279 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 08:11:45,280 INFO L793 eck$LassoCheckResult]: Stem: 145327#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~gate1Failed_History_0~0 := 0;~gate1Failed_History_1~0 := 0;~gate1Failed_History_2~0 := 0;~gate2Failed_History_0~0 := 0;~gate2Failed_History_1~0 := 0;~gate2Failed_History_2~0 := 0;~gate3Failed_History_0~0 := 0;~gate3Failed_History_1~0 := 0;~gate3Failed_History_2~0 := 0;~nomsg~0 := -1;~g1v~0 := 0;~g1v_old~0 := 0;~g1v_new~0 := 0;~g2v~0 := 0;~g2v_old~0 := 0;~g2v_new~0 := 0;~g3v~0 := 0;~g3v_old~0 := 0;~g3v_new~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~0 := 0;~votedValue_History_0~0 := 0;~votedValue_History_1~0 := 0;~votedValue_History_2~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~gate1_each_pals_period.base], ~nodes~0.offset[0 := #funAddr~gate1_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~gate2_each_pals_period.base], ~nodes~0.offset[1 := #funAddr~gate2_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~gate3_each_pals_period.base], ~nodes~0.offset[2 := #funAddr~gate3_each_pals_period.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~voter.base], ~nodes~0.offset[3 := #funAddr~voter.offset]; 145190#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet39, main_#t~nondet40, main_#t~nondet41, main_#t~nondet42, main_#t~nondet43, main_#t~nondet44, main_#t~nondet45, main_#t~nondet46, main_#t~nondet47, main_#t~nondet48, main_#t~nondet49, main_#t~nondet50, main_#t~nondet51, main_#t~nondet52, main_#t~nondet53, main_#t~nondet54, main_#t~nondet55, main_#t~nondet56, main_#t~ret57, main_#t~ret58, main_#t~post59, main_~c1~0, main_~i2~0;havoc main_~c1~0;havoc main_~i2~0;main_~c1~0 := 0;~gate1Failed~0 := main_#t~nondet39;havoc main_#t~nondet39;~gate2Failed~0 := main_#t~nondet40;havoc main_#t~nondet40;~gate3Failed~0 := main_#t~nondet41;havoc main_#t~nondet41;~VALUE1~0 := main_#t~nondet42;havoc main_#t~nondet42;~VALUE2~0 := main_#t~nondet43;havoc main_#t~nondet43;~VALUE3~0 := main_#t~nondet44;havoc main_#t~nondet44;~gate1Failed_History_0~0 := main_#t~nondet45;havoc main_#t~nondet45;~gate1Failed_History_1~0 := main_#t~nondet46;havoc main_#t~nondet46;~gate1Failed_History_2~0 := main_#t~nondet47;havoc main_#t~nondet47;~gate2Failed_History_0~0 := main_#t~nondet48;havoc main_#t~nondet48;~gate2Failed_History_1~0 := main_#t~nondet49;havoc main_#t~nondet49;~gate2Failed_History_2~0 := main_#t~nondet50;havoc main_#t~nondet50;~gate3Failed_History_0~0 := main_#t~nondet51;havoc main_#t~nondet51;~gate3Failed_History_1~0 := main_#t~nondet52;havoc main_#t~nondet52;~gate3Failed_History_2~0 := main_#t~nondet53;havoc main_#t~nondet53;~votedValue_History_0~0 := main_#t~nondet54;havoc main_#t~nondet54;~votedValue_History_1~0 := main_#t~nondet55;havoc main_#t~nondet55;~votedValue_History_2~0 := main_#t~nondet56;havoc main_#t~nondet56;assume { :begin_inline_init } true;havoc init_#res;havoc init_#t~ret5, init_#t~ret6, init_#t~ret7, init_#t~ret8, init_~tmp~1, init_~tmp___0~1, init_~tmp___1~1, init_~tmp___2~1;havoc init_~tmp~1;havoc init_~tmp___0~1;havoc init_~tmp___1~1;havoc init_~tmp___2~1;assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 0;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145191#L116-3 assume true; 145409#L116-1 assume !!(add_history_type_~var~0 < 3); 145692#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145691#L171 assume read_history_bool_~history_id == 0; 145687#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 145684#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 145683#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 145682#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145681#L116-3 assume true; 145415#L116-1 assume !!(add_history_type_~var~0 < 3); 145384#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145288#L171 assume read_history_bool_~history_id == 0; 145289#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 145174#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 145282#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 145283#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145410#L116-3 assume true; 145411#L116-1 assume !!(add_history_type_~var~0 < 3); 145679#L117 assume add_history_type_~history_id == 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145677#L171 assume read_history_bool_~history_id == 0; 145673#L172 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate1Failed_History_0~0; 145669#L203 add_history_type_#t~ret0 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 145649#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 145466#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145451#L116-3 assume true; 145414#L116-1 assume !(add_history_type_~var~0 < 3); 145407#L116-4 add_history_type_#res := 1; 145300#L143 init_#t~ret5 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 145301#L255 assume !(init_~tmp~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 1;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145379#L116-8 assume true; 145420#L116-6 assume !!(add_history_type_~var~0 < 3); 145376#L117-2 assume !(add_history_type_~history_id == 0); 145377#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145412#L171-4 assume !(read_history_bool_~history_id == 0); 145337#L181-4 assume read_history_bool_~history_id == 1; 145338#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 145272#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145213#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 145214#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145651#L116-8 assume true; 145652#L116-6 assume !!(add_history_type_~var~0 < 3); 145663#L117-2 assume !(add_history_type_~history_id == 0); 145662#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145661#L171-4 assume !(read_history_bool_~history_id == 0); 145660#L181-4 assume read_history_bool_~history_id == 1; 145657#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 145654#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145653#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 145427#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145421#L116-8 assume true; 145422#L116-6 assume !!(add_history_type_~var~0 < 3); 145650#L117-2 assume !(add_history_type_~history_id == 0); 145465#L123-2 assume add_history_type_~history_id == 1;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 1, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145464#L171-4 assume !(read_history_bool_~history_id == 0); 145462#L181-4 assume read_history_bool_~history_id == 1; 145458#L182-4 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate2Failed_History_0~0; 145455#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 145454#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 145453#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145452#L116-8 assume true; 145425#L116-6 assume !(add_history_type_~var~0 < 3); 145419#L116-9 add_history_type_#res := 1; 145333#L143-1 init_#t~ret6 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 145294#L259 assume !(init_~tmp___0~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 2;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145295#L116-13 assume true; 145450#L116-11 assume !!(add_history_type_~var~0 < 3); 145372#L117-4 assume !(add_history_type_~history_id == 0); 145373#L123-4 assume !(add_history_type_~history_id == 1); 145507#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145505#L171-8 assume !(read_history_bool_~history_id == 0); 145504#L181-8 assume !(read_history_bool_~history_id == 1); 145502#L191-8 assume read_history_bool_~history_id == 2; 145500#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 145497#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 145495#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 145478#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145475#L116-13 assume true; 145473#L116-11 assume !!(add_history_type_~var~0 < 3); 145374#L117-4 assume !(add_history_type_~history_id == 0); 145375#L123-4 assume !(add_history_type_~history_id == 1); 145435#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145424#L171-8 assume !(read_history_bool_~history_id == 0); 145347#L181-8 assume !(read_history_bool_~history_id == 1); 145222#L191-8 assume read_history_bool_~history_id == 2; 145223#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 145350#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 145199#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 145200#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145395#L116-13 assume true; 145396#L116-11 assume !!(add_history_type_~var~0 < 3); 145398#L117-4 assume !(add_history_type_~history_id == 0); 145449#L123-4 assume !(add_history_type_~history_id == 1); 145434#L129-4 assume add_history_type_~history_id == 2;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 2, 0;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145423#L171-8 assume !(read_history_bool_~history_id == 0); 145346#L181-8 assume !(read_history_bool_~history_id == 1); 145220#L191-8 assume read_history_bool_~history_id == 2; 145221#L192-8 assume read_history_bool_~historyIndex == 0;read_history_bool_#res := ~gate3Failed_History_0~0; 145348#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 145197#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 145198#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145393#L116-13 assume true; 145394#L116-11 assume !(add_history_type_~var~0 < 3); 145391#L116-14 add_history_type_#res := 1; 145330#L143-2 init_#t~ret7 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 145181#L263 assume !(init_~tmp___1~1 == 0);assume { :begin_inline_add_history_type } true;add_history_type_#in~history_id := 3;havoc add_history_type_#res;havoc add_history_type_#t~ret0, add_history_type_#t~ret1, add_history_type_#t~ret2, add_history_type_#t~ret3, add_history_type_#t~post4, add_history_type_~history_id, add_history_type_~ini_bool~0, add_history_type_~ini_int~0, add_history_type_~var~0, add_history_type_~tmp~0, add_history_type_~tmp___0~0, add_history_type_~tmp___1~0, add_history_type_~tmp___2~0;add_history_type_~history_id := add_history_type_#in~history_id;havoc add_history_type_~ini_bool~0;havoc add_history_type_~ini_int~0;havoc add_history_type_~var~0;havoc add_history_type_~tmp~0;havoc add_history_type_~tmp___0~0;havoc add_history_type_~tmp___1~0;havoc add_history_type_~tmp___2~0;add_history_type_~ini_bool~0 := 0;add_history_type_~ini_int~0 := -2;add_history_type_~var~0 := 0; 145182#L116-18 assume true; 145401#L116-16 assume !!(add_history_type_~var~0 < 3); 145363#L117-6 assume !(add_history_type_~history_id == 0); 145364#L123-6 assume !(add_history_type_~history_id == 1); 145489#L129-6 assume !(add_history_type_~history_id == 2); 145487#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145485#L151-3 assume read_history_int8_~history_id == 3; 145483#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 145481#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 145479#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 145476#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145474#L116-18 assume true; 145471#L116-16 assume !!(add_history_type_~var~0 < 3); 145365#L117-6 assume !(add_history_type_~history_id == 0); 145366#L123-6 assume !(add_history_type_~history_id == 1); 145430#L129-6 assume !(add_history_type_~history_id == 2); 145267#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145268#L151-3 assume read_history_int8_~history_id == 3; 145275#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 145276#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 145280#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 145263#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145264#L116-18 assume true; 145402#L116-16 assume !!(add_history_type_~var~0 < 3); 145404#L117-6 assume !(add_history_type_~history_id == 0); 145448#L123-6 assume !(add_history_type_~history_id == 1); 145429#L129-6 assume !(add_history_type_~history_id == 2); 145265#L135-9 assume add_history_type_~history_id == 3;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145266#L151-3 assume read_history_int8_~history_id == 3; 145273#L152-3 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 145274#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 145279#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 145261#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := add_history_type_#t~post4 + 1;havoc add_history_type_#t~post4; 145262#L116-18 assume true; 145403#L116-16 assume !(add_history_type_~var~0 < 3); 145400#L116-19 add_history_type_#res := 1; 145328#L143-3 init_#t~ret8 := add_history_type_#res;assume { :end_inline_add_history_type } true;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 145329#L267 assume !(init_~tmp___2~1 == 0);init_#res := 1; 145298#L270 main_#t~ret57 := init_#res;assume { :end_inline_init } true;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume main_~i2~0 != 0;~g1v_old~0 := ~nomsg~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~nomsg~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~nomsg~0;~g3v_new~0 := ~nomsg~0;main_~i2~0 := 0; 145299#L558-3 assume true; 145630#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145627#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 145626#L236-2 assume { :end_inline_write_history_bool } true; 145625#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 145624#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 145622#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 145621#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 145619#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 145367#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145368#L226-2 assume !(write_history_bool_~history_id == 0); 145612#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 145609#L236-5 assume { :end_inline_write_history_bool } true; 145595#L421 assume ~gate2Failed~0 % 256 != 0; 145591#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 145587#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 145585#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145581#L226-4 assume !(write_history_bool_~history_id == 0); 145577#L231-4 assume !(write_history_bool_~history_id == 1); 145572#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 145567#L236-8 assume { :end_inline_write_history_bool } true; 145566#L452 assume ~gate3Failed~0 % 256 != 0; 145383#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 145370#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 145371#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 145381#L486 assume !(~VALUE1~0 == ~VALUE2~0); 145382#L493 assume ~VALUE1~0 == ~VALUE3~0; 145206#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 145207#L514-2 [2018-11-10 08:11:46,511 INFO L795 eck$LassoCheckResult]: Loop: 145207#L514-2 assume { :begin_inline_write_history_int8 } true;write_history_int8_#in~history_id, write_history_int8_#in~buf := 3, voter_~voted_value~0;havoc write_history_int8_~history_id, write_history_int8_~buf;write_history_int8_~history_id := write_history_int8_#in~history_id;write_history_int8_~buf := write_history_int8_#in~buf; 145666#L211 assume write_history_int8_~history_id == 3;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 145665#L211-2 assume { :end_inline_write_history_int8 } true; 145664#L520 assume { :end_inline_voter } true;~g1v_old~0 := ~g1v_new~0;~g1v_new~0 := ~nomsg~0;~g2v_old~0 := ~g2v_new~0;~g2v_new~0 := ~nomsg~0;~g3v_old~0 := ~g3v_new~0;~g3v_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res;havoc check_#t~ret9, check_#t~ret10, check_#t~ret11, check_#t~ret12, check_#t~post13, check_#t~ret14, check_#t~post15, check_#t~ret16, check_#t~post17, check_#t~ret18, check_#t~ret19, check_#t~ret20, check_#t~ret21, check_#t~ret22, check_#t~ret23, check_#t~ret24, check_#t~ret25, check_#t~ret26, check_~tmp~2, check_~temp_count~0, check_~tmp___0~2, check_~tmp___1~2, check_~tmp___2~2, check_~tmp___3~0, check_~tmp___4~0, check_~tmp___5~0, check_~tmp___6~0, check_~tmp___7~0, check_~tmp___8~0, check_~tmp___9~0, check_~tmp___10~0, check_~tmp___11~0, check_~tmp___12~0, check_~tmp___13~0, check_~tmp___14~0;havoc check_~tmp~2;havoc check_~temp_count~0;havoc check_~tmp___0~2;havoc check_~tmp___1~2;havoc check_~tmp___2~2;havoc check_~tmp___3~0;havoc check_~tmp___4~0;havoc check_~tmp___5~0;havoc check_~tmp___6~0;havoc check_~tmp___7~0;havoc check_~tmp___8~0;havoc check_~tmp___9~0;havoc check_~tmp___10~0;havoc check_~tmp___11~0;havoc check_~tmp___12~0;havoc check_~tmp___13~0;havoc check_~tmp___14~0; 145524#L294 assume ~gate1Failed~0 % 256 == 0;check_~tmp~2 := 1; 145522#L300-2 assume (if check_~tmp~2 == 0 then 0 else 1) % 256 != 0;assume { :begin_inline_read_history_bool } true;read_history_bool_#in~history_id, read_history_bool_#in~historyIndex := 0, 1;havoc read_history_bool_#res;havoc read_history_bool_~history_id, read_history_bool_~historyIndex;read_history_bool_~history_id := read_history_bool_#in~history_id;read_history_bool_~historyIndex := read_history_bool_#in~historyIndex; 145520#L171-12 assume read_history_bool_~history_id == 0; 145380#L172-12 assume !(read_history_bool_~historyIndex == 0); 145360#L175-12 assume read_history_bool_~historyIndex == 1;read_history_bool_#res := ~gate1Failed_History_1~0; 145344#L203-12 check_#t~ret9 := read_history_bool_#res;assume { :end_inline_read_history_bool } true;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 145345#L307 assume !(check_~tmp___3~0 % 256 == 0); 145195#L307-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 1;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145201#L151-7 assume read_history_int8_~history_id == 3; 145232#L152-7 assume !(read_history_int8_~historyIndex == 0); 145233#L155-7 assume read_history_int8_~historyIndex == 1;read_history_int8_#res := ~votedValue_History_1~0; 145234#L163-7 check_#t~ret18 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 145235#L346 assume check_~tmp___10~0 > -2;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145362#L151-8 assume read_history_int8_~history_id == 3; 145229#L152-8 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 145230#L163-8 check_#t~ret19 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 145231#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 145387#L346-1 assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145648#L151-9 assume read_history_int8_~history_id == 3; 145226#L152-9 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 145227#L163-9 check_#t~ret23 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 145228#L366 assume check_~tmp___11~0 != ~nomsg~0;assume { :begin_inline_read_history_int8 } true;read_history_int8_#in~history_id, read_history_int8_#in~historyIndex := 3, 0;havoc read_history_int8_#res;havoc read_history_int8_~history_id, read_history_int8_~historyIndex;read_history_int8_~history_id := read_history_int8_#in~history_id;read_history_int8_~historyIndex := read_history_int8_#in~historyIndex; 145428#L151-10 assume read_history_int8_~history_id == 3; 145256#L152-10 assume read_history_int8_~historyIndex == 0;read_history_int8_#res := ~votedValue_History_0~0; 145257#L163-10 check_#t~ret24 := read_history_int8_#res;assume { :end_inline_read_history_int8 } true;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 145258#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 145270#L366-1 check_#res := 1; 145259#L378 main_#t~ret58 := check_#res;assume { :end_inline_check } true;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assume { :begin_inline_assert } true;assert_#in~arg := (if main_~c1~0 == 0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 145260#L583-72 assume !(assert_~arg % 256 == 0); 145378#L578-36 assume { :end_inline_assert } true;main_#t~post59 := main_~i2~0;main_~i2~0 := main_#t~post59 + 1;havoc main_#t~post59; 145385#L558-3 assume true; 145445#L558-1 assume !!(main_~i2~0 < 10);assume { :begin_inline_gate1_each_pals_period } true;havoc gate1_each_pals_period_#t~nondet27, gate1_each_pals_period_#t~ite28, gate1_each_pals_period_#t~nondet29, gate1_each_pals_period_#t~ite30, gate1_each_pals_period_~next_state~0, gate1_each_pals_period_~tmp~3, gate1_each_pals_period_~tmp___0~3;havoc gate1_each_pals_period_~next_state~0;havoc gate1_each_pals_period_~tmp~3;havoc gate1_each_pals_period_~tmp___0~3;~gate1Failed~0 := gate1_each_pals_period_#t~nondet27;havoc gate1_each_pals_period_#t~nondet27;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 0, ~gate1Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145291#L226 assume write_history_bool_~history_id == 0;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 145292#L236-2 assume { :end_inline_write_history_bool } true; 145357#L390 assume !(~gate1Failed~0 % 256 != 0);gate1_each_pals_period_~tmp~3 := gate1_each_pals_period_#t~nondet29;havoc gate1_each_pals_period_#t~nondet29;gate1_each_pals_period_~next_state~0 := gate1_each_pals_period_~tmp~3; 145340#L396 assume gate1_each_pals_period_~next_state~0 == 0;gate1_each_pals_period_~tmp___0~3 := 1; 145296#L402-2 assume (if gate1_each_pals_period_~tmp___0~3 == 0 then 0 else 1) % 256 != 0; 145297#L408 assume gate1_each_pals_period_~next_state~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0;gate1_each_pals_period_#t~ite30 := gate1_each_pals_period_~next_state~0; 145408#L408-2 ~g1v_new~0 := (if gate1_each_pals_period_#t~ite30 % 256 <= 127 then gate1_each_pals_period_#t~ite30 % 256 else gate1_each_pals_period_#t~ite30 % 256 - 256);havoc gate1_each_pals_period_#t~ite30; 145413#L409 assume { :end_inline_gate1_each_pals_period } true;assume { :begin_inline_gate2_each_pals_period } true;havoc gate2_each_pals_period_#t~nondet31, gate2_each_pals_period_#t~ite32, gate2_each_pals_period_#t~nondet33, gate2_each_pals_period_#t~ite34, gate2_each_pals_period_~next_state~1, gate2_each_pals_period_~tmp~4, gate2_each_pals_period_~tmp___0~4;havoc gate2_each_pals_period_~next_state~1;havoc gate2_each_pals_period_~tmp~4;havoc gate2_each_pals_period_~tmp___0~4;~gate2Failed~0 := gate2_each_pals_period_#t~nondet31;havoc gate2_each_pals_period_#t~nondet31;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 1, ~gate2Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145286#L226-2 assume !(write_history_bool_~history_id == 0); 145287#L231-2 assume write_history_bool_~history_id == 1;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 145305#L236-5 assume { :end_inline_write_history_bool } true; 145342#L421 assume ~gate2Failed~0 % 256 != 0; 145252#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 145224#L422-2 ~g2v_new~0 := (if gate2_each_pals_period_#t~ite32 % 256 <= 127 then gate2_each_pals_period_#t~ite32 % 256 else gate2_each_pals_period_#t~ite32 % 256 - 256);havoc gate2_each_pals_period_#t~ite32; 145225#L440 assume { :end_inline_gate2_each_pals_period } true;assume { :begin_inline_gate3_each_pals_period } true;havoc gate3_each_pals_period_#t~nondet35, gate3_each_pals_period_#t~ite36, gate3_each_pals_period_#t~nondet37, gate3_each_pals_period_#t~ite38, gate3_each_pals_period_~next_state~2, gate3_each_pals_period_~tmp~5, gate3_each_pals_period_~tmp___0~5;havoc gate3_each_pals_period_~next_state~2;havoc gate3_each_pals_period_~tmp~5;havoc gate3_each_pals_period_~tmp___0~5;~gate3Failed~0 := gate3_each_pals_period_#t~nondet35;havoc gate3_each_pals_period_#t~nondet35;assume { :begin_inline_write_history_bool } true;write_history_bool_#in~history_id, write_history_bool_#in~buf := 2, ~gate3Failed~0;havoc write_history_bool_~history_id, write_history_bool_~buf;write_history_bool_~history_id := write_history_bool_#in~history_id;write_history_bool_~buf := write_history_bool_#in~buf; 145582#L226-4 assume !(write_history_bool_~history_id == 0); 145578#L231-4 assume !(write_history_bool_~history_id == 1); 145573#L236-6 assume write_history_bool_~history_id == 2;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 145568#L236-8 assume { :end_inline_write_history_bool } true; 145564#L452 assume ~gate3Failed~0 % 256 != 0; 145565#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 145676#L453-2 ~g3v_new~0 := (if gate3_each_pals_period_#t~ite36 % 256 <= 127 then gate3_each_pals_period_#t~ite36 % 256 else gate3_each_pals_period_#t~ite36 % 256 - 256);havoc gate3_each_pals_period_#t~ite36; 145675#L471 assume { :end_inline_gate3_each_pals_period } true;assume { :begin_inline_voter } true;havoc voter_~voted_value~0;havoc voter_~voted_value~0;voter_~voted_value~0 := ~nomsg~0;~VALUE1~0 := ~g1v_old~0;~g1v_old~0 := ~nomsg~0;~VALUE2~0 := ~g2v_old~0;~g2v_old~0 := ~nomsg~0;~VALUE3~0 := ~g3v_old~0;~g3v_old~0 := ~nomsg~0; 145670#L486 assume !(~VALUE1~0 == ~VALUE2~0); 145668#L493 assume ~VALUE1~0 == ~VALUE3~0; 145667#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 145207#L514-2 [2018-11-10 08:11:47,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:11:47,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1891555786, now seen corresponding path program 1 times [2018-11-10 08:11:47,185 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:11:47,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:11:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:11:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:47,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:11:47,341 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2018-11-10 08:11:47,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 08:11:47,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 08:11:47,341 INFO L798 eck$LassoCheckResult]: stem already infeasible [2018-11-10 08:11:47,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:11:47,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1753500014, now seen corresponding path program 2 times [2018-11-10 08:11:47,342 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 08:11:47,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 08:11:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:47,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 08:11:47,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 08:11:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:11:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 08:11:48,204 WARN L179 SmtUtils]: Spent 839.00 ms on a formula simplification. DAG size of input: 283 DAG size of output: 244 [2018-11-10 08:11:49,234 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-11-10 08:11:49,235 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:11:49,236 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:11:49,236 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:11:49,236 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:11:49,236 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 08:11:49,236 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:49,236 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:11:49,236 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:11:49,236 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration32_Loop [2018-11-10 08:11:49,236 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:11:49,236 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:11:49,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,407 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-10 08:11:49,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,429 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,449 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,454 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,483 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,487 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:11:49,738 WARN L179 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 08:11:49,941 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:11:53,543 WARN L179 SmtUtils]: Spent 3.57 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-10 08:11:53,658 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:11:53,658 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 211 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 211 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,665 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,665 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_29=-1} Honda state: {v_rep#funAddr~voter.base_29=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 212 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 212 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,682 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,682 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,684 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,684 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___7~0=0} Honda state: {ULTIMATE.start_check_~tmp___7~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 213 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 213 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,702 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,704 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,704 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~nondet37=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 214 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 214 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,722 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,725 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,725 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=2, ULTIMATE.start_write_history_bool_~history_id=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 215 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 215 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,743 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,743 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,746 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,746 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~nondet29=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 216 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 216 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,769 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,769 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,771 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,771 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___14~0=0} Honda state: {ULTIMATE.start_check_~tmp___14~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 217 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 217 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,797 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,797 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,799 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,799 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite32=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 218 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 218 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,826 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,826 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,828 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,828 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~nondet31=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 219 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 219 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,846 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,846 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,873 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,873 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_29=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_29=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 220 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 220 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,877 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,878 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,879 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,879 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret14=0} Honda state: {ULTIMATE.start_check_#t~ret14=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 221 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 221 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,898 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,898 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,900 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,900 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret58=0} Honda state: {ULTIMATE.start_main_#t~ret58=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 222 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 222 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,920 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,920 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret10=0} Honda state: {ULTIMATE.start_check_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 223 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 223 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,946 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,946 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,948 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,948 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Honda state: {ULTIMATE.start_gate2_each_pals_period_#t~ite34=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 224 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 224 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,968 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,968 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~post59=0} Honda state: {ULTIMATE.start_main_#t~post59=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 225 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 225 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:53,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:53,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:53,988 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:53,988 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___13~0=0} Honda state: {ULTIMATE.start_check_~tmp___13~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 226 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 226 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:54,005 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:54,005 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:54,010 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:54,010 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~temp_count~0=0} Honda state: {ULTIMATE.start_check_~temp_count~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 227 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 227 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:54,027 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:54,027 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:54,029 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:54,029 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret16=0} Honda state: {ULTIMATE.start_check_#t~ret16=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 228 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 228 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:54,049 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:54,050 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:11:54,051 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 08:11:54,052 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___9~0=0} Honda state: {ULTIMATE.start_check_~tmp___9~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 229 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 229 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:54,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 08:11:54,069 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d6e5c648-7e6a-4b00-a8e2-cf3b343ad165/bin-2019/uautomizer/z3 Starting monitored process 230 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 230 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:11:54,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 08:11:54,716 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 08:12:06,930 INFO L448 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-11-10 08:12:06,945 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 08:12:06,945 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 08:12:06,945 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 08:12:06,945 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 08:12:06,945 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 08:12:06,946 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 08:12:06,946 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 08:12:06,946 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 08:12:06,946 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration32_Loop [2018-11-10 08:12:06,946 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 08:12:06,946 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 08:12:06,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:06,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,006 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,195 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-10 08:12:07,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,251 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,276 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 08:12:07,472 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2018-11-10 08:12:07,696 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-11-10 08:12:07,772 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 08:12:11,414 WARN L179 SmtUtils]: Spent 3.58 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-11-10 08:12:11,474 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 08:12:11,474 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 08:12:11,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,478 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,479 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,480 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,482 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,483 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,484 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,487 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,493 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,495 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,496 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,498 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,499 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,500 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,500 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,502 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,506 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,509 INFO L206 nArgumentSynthesizer]: 12 loop disjuncts [2018-11-10 08:12:11,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,520 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-11-10 08:12:11,521 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,618 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,619 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,622 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,623 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,624 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,628 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,629 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,629 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,629 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,632 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,633 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,634 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,639 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,640 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,641 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,643 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 08:12:11,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 08:12:11,645 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,648 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,649 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,650 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,650 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,650 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,651 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,688 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,689 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,689 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,870 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,871 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:11,871 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:11,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:11,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:11,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:11,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:11,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:11,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:11,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:11,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,031 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,032 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,032 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,033 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,034 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,219 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,220 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,220 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,221 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,221 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,408 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 08:12:12,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 08:12:12,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 08:12:12,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 08:12:12,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 08:12:12,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 08:12:12,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 08:12:12,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 08:12:12,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 08:12:12,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 08:12:12,410 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-10 08:12:12,410 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-10 08:12:12,410 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 08:12:12,410 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-10 08:12:12,410 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 08:12:12,410 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-11-10 08:12:12,410 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-11-10 08:12:12,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 08:12:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:12:12,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:12:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 08:12:12,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 08:12:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 08:12:12,539 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-10 08:12:12,539 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 528 states and 656 transitions. cyclomatic complexity: 133 Second operand 5 states. [2018-11-10 08:12:12,552 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 528 states and 656 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 818 states and 1019 transitions. Complement of second has 6 states. [2018-11-10 08:12:12,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-10 08:12:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-10 08:12:12,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 334 transitions. [2018-11-10 08:12:12,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 334 transitions. Stem has 174 letters. Loop has 62 letters. [2018-11-10 08:12:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:12:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 334 transitions. Stem has 236 letters. Loop has 62 letters. [2018-11-10 08:12:12,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:12:12,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 334 transitions. Stem has 174 letters. Loop has 124 letters. [2018-11-10 08:12:12,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 08:12:12,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 818 states and 1019 transitions. [2018-11-10 08:12:12,602 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:12:12,602 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 818 states to 0 states and 0 transitions. [2018-11-10 08:12:12,602 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 08:12:12,602 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 08:12:12,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 08:12:12,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:12:12,602 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:12:12,603 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:12:12,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 08:12:12,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-10 08:12:12,603 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2018-11-10 08:12:12,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 08:12:12,603 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-10 08:12:12,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 08:12:12,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-11-10 08:12:12,603 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:12:12,603 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 08:12:12,603 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 08:12:12,603 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 08:12:12,603 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 08:12:12,604 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 08:12:12,604 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:12:12,604 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:12:12,604 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 08:12:12,780 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-11-10 08:12:12,780 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 08:12:12,780 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 08:12:12,780 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 08:12:12,786 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 08:12:12 BoogieIcfgContainer [2018-11-10 08:12:12,786 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 08:12:12,787 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 08:12:12,787 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 08:12:12,787 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 08:12:12,787 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 08:08:13" (3/4) ... [2018-11-10 08:12:12,791 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 08:12:12,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 08:12:12,792 INFO L168 Benchmark]: Toolchain (without parser) took 241331.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 497.5 MB). Free memory was 959.2 MB in the beginning and 873.5 MB in the end (delta: 85.8 MB). Peak memory consumption was 583.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:12:12,793 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:12:12,793 INFO L168 Benchmark]: CACSL2BoogieTranslator took 250.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-10 08:12:12,793 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -230.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-11-10 08:12:12,793 INFO L168 Benchmark]: Boogie Preprocessor took 59.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-10 08:12:12,794 INFO L168 Benchmark]: RCFGBuilder took 1220.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 141.3 MB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:12:12,794 INFO L168 Benchmark]: BuchiAutomizer took 239701.45 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 1.0 GB in the beginning and 873.5 MB in the end (delta: 149.1 MB). Peak memory consumption was 467.3 MB. Max. memory is 11.5 GB. [2018-11-10 08:12:12,794 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.5 GB. Free memory is still 873.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 08:12:12,796 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 250.60 ms. Allocated memory is still 1.0 GB. Free memory was 956.6 MB in the beginning and 940.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.3 MB). Free memory was 940.5 MB in the beginning and 1.2 GB in the end (delta: -230.0 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1220.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 141.3 MB). Peak memory consumption was 141.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 239701.45 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 318.2 MB). Free memory was 1.0 GB in the beginning and 873.5 MB in the end (delta: 149.1 MB). Peak memory consumption was 467.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.5 GB. Free memory is still 873.5 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 47 terminating modules (32 trivial, 15 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * var + 5 and consists of 5 locations. One deterministic module has affine ranking function -2 * var + 5 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -2 * var + 3 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 19 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -1 * votedValue_History_0 + -1 * g1v_\old + nomsg and consists of 19 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -1 * \result + nomsg + -1 * g1v_\old and consists of 19 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. One deterministic module has affine ranking function -2 * i2 + 17 and consists of 4 locations. 32 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 239.6s and 33 iterations. TraceHistogramMax:4. Analysis of lassos took 229.6s. Construction of modules took 3.0s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 45. Automata minimization 0.6s AutomataMinimizationTime, 45 MinimizatonAttempts, 24341 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.4s Buchi closure took 0.0s. Biggest automaton had 2180 states and ocurred in iteration 24. Nontrivial modules had stage [15, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 28248 SDtfs, 27429 SDslu, 43969 SDs, 0 SdLazy, 5002 SolverSat, 492 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI17 SILT14 lasso0 LassoPreprocessingBenchmarks: Lassos: inital745 mio100 ax154 hnf107 lsp24 ukn74 mio100 lsp100 div150 bol100 ite100 ukn100 eq176 hnf77 smp100 dnf4723 smp17 tf103 neg99 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 136ms VariablesStem: 0 VariablesLoop: 36 DisjunctsStem: 1 DisjunctsLoop: 24 SupportingInvariants: 0 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 194 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 6 LassoNonterminationAnalysisTime: 77.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...