./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-635dfa2 [2018-12-02 12:39:17,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 12:39:17,890 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 12:39:17,896 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 12:39:17,896 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 12:39:17,896 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 12:39:17,897 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 12:39:17,898 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 12:39:17,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 12:39:17,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 12:39:17,899 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 12:39:17,899 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 12:39:17,900 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 12:39:17,900 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 12:39:17,901 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 12:39:17,901 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 12:39:17,902 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 12:39:17,902 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 12:39:17,903 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 12:39:17,904 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 12:39:17,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 12:39:17,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 12:39:17,906 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 12:39:17,906 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 12:39:17,906 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 12:39:17,907 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 12:39:17,907 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 12:39:17,907 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 12:39:17,908 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 12:39:17,908 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 12:39:17,908 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 12:39:17,909 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 12:39:17,909 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 12:39:17,909 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 12:39:17,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 12:39:17,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 12:39:17,910 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 12:39:17,918 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 12:39:17,918 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 12:39:17,918 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 12:39:17,918 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 12:39:17,919 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 12:39:17,919 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 12:39:17,919 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 12:39:17,919 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 12:39:17,919 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 12:39:17,919 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 12:39:17,919 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 12:39:17,919 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 12:39:17,920 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 12:39:17,921 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 12:39:17,921 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 12:39:17,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 12:39:17,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 12:39:17,922 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 12:39:17,922 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 12:39:17,922 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:17,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 12:39:17,945 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 12:39:17,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 12:39:17,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 12:39:17,948 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 12:39:17,948 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 12:39:17,982 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/data/d10cea4f3/4edec96d0ec2433cbb2f51614b7029f8/FLAG99be5bd7e [2018-12-02 12:39:18,432 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 12:39:18,432 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 12:39:18,437 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/data/d10cea4f3/4edec96d0ec2433cbb2f51614b7029f8/FLAG99be5bd7e [2018-12-02 12:39:18,445 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/data/d10cea4f3/4edec96d0ec2433cbb2f51614b7029f8 [2018-12-02 12:39:18,447 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 12:39:18,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 12:39:18,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 12:39:18,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 12:39:18,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 12:39:18,450 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354f5439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18, skipping insertion in model container [2018-12-02 12:39:18,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 12:39:18,474 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 12:39:18,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:39:18,598 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 12:39:18,668 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 12:39:18,682 INFO L195 MainTranslator]: Completed translation [2018-12-02 12:39:18,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18 WrapperNode [2018-12-02 12:39:18,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 12:39:18,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 12:39:18,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 12:39:18,683 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 12:39:18,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,695 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 12:39:18,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 12:39:18,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 12:39:18,737 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 12:39:18,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,751 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... [2018-12-02 12:39:18,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 12:39:18,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 12:39:18,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 12:39:18,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 12:39:18,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:18,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 12:39:18,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 12:39:19,545 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 12:39:19,546 INFO L280 CfgBuilder]: Removed 173 assue(true) statements. [2018-12-02 12:39:19,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:19 BoogieIcfgContainer [2018-12-02 12:39:19,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 12:39:19,546 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 12:39:19,547 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 12:39:19,549 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 12:39:19,549 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 12:39:19,549 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 12:39:18" (1/3) ... [2018-12-02 12:39:19,550 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b6804b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 12:39:19, skipping insertion in model container [2018-12-02 12:39:19,550 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 12:39:19,550 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:39:18" (2/3) ... [2018-12-02 12:39:19,551 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b6804b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 12:39:19, skipping insertion in model container [2018-12-02 12:39:19,551 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 12:39:19,551 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:19" (3/3) ... [2018-12-02 12:39:19,552 INFO L375 chiAutomizerObserver]: Analyzing ICFG pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c [2018-12-02 12:39:19,584 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 12:39:19,584 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 12:39:19,584 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 12:39:19,584 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 12:39:19,584 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 12:39:19,585 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 12:39:19,585 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 12:39:19,585 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 12:39:19,585 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 12:39:19,600 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 479 states. [2018-12-02 12:39:19,624 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 460 [2018-12-02 12:39:19,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:19,625 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:19,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 12:39:19,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 12:39:19,630 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 12:39:19,630 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 479 states. [2018-12-02 12:39:19,637 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 460 [2018-12-02 12:39:19,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:19,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:19,637 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-02 12:39:19,637 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 12:39:19,642 INFO L794 eck$LassoCheckResult]: Stem: 316#ULTIMATE.startENTRYtrue ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 235#L-1true 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;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;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; 401#L116-2true [2018-12-02 12:39:19,642 INFO L796 eck$LassoCheckResult]: Loop: 401#L116-2true assume !!(add_history_type_~var~0 < 3); 358#L117true assume !(0 == add_history_type_~history_id); 219#L123true assume !(1 == add_history_type_~history_id); 467#L129true assume !(2 == add_history_type_~history_id); 187#L135true assume !(3 == add_history_type_~history_id); 186#L135-2true add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 401#L116-2true [2018-12-02 12:39:19,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:19,646 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-02 12:39:19,647 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:19,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:19,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:19,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:19,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:19,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:19,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1278004263, now seen corresponding path program 1 times [2018-12-02 12:39:19,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:19,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:19,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:19,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:19,740 INFO L82 PathProgramCache]: Analyzing trace with hash 358053481, now seen corresponding path program 1 times [2018-12-02 12:39:19,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:19,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:19,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:19,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:19,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:19,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:19,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:19,826 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:19,827 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:19,827 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:19,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:19,828 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:19,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:19,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:19,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:19,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-12-02 12:39:19,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:19,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,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-12-02 12:39:19,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:19,996 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:19,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:19,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,017 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,017 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,023 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,023 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,041 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,041 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,056 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,056 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,059 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,059 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,073 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,089 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,089 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,092 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,092 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,108 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,108 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,111 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,136 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,139 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,139 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,142 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,166 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,166 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,181 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,183 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,183 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,198 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:39:20,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,230 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 12:39:20,231 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:20,231 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:20,231 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:20,231 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:20,231 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:39:20,231 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:20,231 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:20,232 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:20,232 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration1_Loop [2018-12-02 12:39:20,232 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:20,232 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,378 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:20,381 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:39:20,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-12-02 12:39:20,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,390 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,391 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:20,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:20,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:20,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:20,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:20,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,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-12-02 12:39:20,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:20,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,420 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 12:39:20,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 12:39:20,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:20,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:20,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:20,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:20,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:20,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:20,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:20,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:20,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:20,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:20,424 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:39:20,426 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:39:20,426 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:39:20,427 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:39:20,427 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:39:20,427 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:39:20,428 INFO L520 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-12-02 12:39:20,428 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:39:20,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:20,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:20,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:20,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:20,489 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-12-02 12:39:20,490 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 479 states. Second operand 3 states. [2018-12-02 12:39:20,606 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 479 states.. Second operand 3 states. Result 1983 states and 3315 transitions. Complement of second has 8 states. [2018-12-02 12:39:20,607 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-12-02 12:39:20,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 12:39:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1735 transitions. [2018-12-02 12:39:20,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1735 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-02 12:39:20,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:20,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1735 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-02 12:39:20,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:20,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 1735 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-02 12:39:20,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:20,615 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1983 states and 3315 transitions. [2018-12-02 12:39:20,632 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 834 [2018-12-02 12:39:20,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1983 states to 956 states and 1602 transitions. [2018-12-02 12:39:20,644 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 902 [2018-12-02 12:39:20,646 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 904 [2018-12-02 12:39:20,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 956 states and 1602 transitions. [2018-12-02 12:39:20,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:20,648 INFO L705 BuchiCegarLoop]: Abstraction has 956 states and 1602 transitions. [2018-12-02 12:39:20,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states and 1602 transitions. [2018-12-02 12:39:20,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 738. [2018-12-02 12:39:20,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 738 states. [2018-12-02 12:39:20,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1245 transitions. [2018-12-02 12:39:20,684 INFO L728 BuchiCegarLoop]: Abstraction has 738 states and 1245 transitions. [2018-12-02 12:39:20,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:20,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:20,687 INFO L87 Difference]: Start difference. First operand 738 states and 1245 transitions. Second operand 3 states. [2018-12-02 12:39:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:20,743 INFO L93 Difference]: Finished difference Result 921 states and 1484 transitions. [2018-12-02 12:39:20,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:20,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 921 states and 1484 transitions. [2018-12-02 12:39:20,750 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 810 [2018-12-02 12:39:20,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 921 states to 867 states and 1430 transitions. [2018-12-02 12:39:20,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 851 [2018-12-02 12:39:20,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 851 [2018-12-02 12:39:20,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 867 states and 1430 transitions. [2018-12-02 12:39:20,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:20,757 INFO L705 BuchiCegarLoop]: Abstraction has 867 states and 1430 transitions. [2018-12-02 12:39:20,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states and 1430 transitions. [2018-12-02 12:39:20,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 426. [2018-12-02 12:39:20,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-12-02 12:39:20,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 710 transitions. [2018-12-02 12:39:20,768 INFO L728 BuchiCegarLoop]: Abstraction has 426 states and 710 transitions. [2018-12-02 12:39:20,768 INFO L608 BuchiCegarLoop]: Abstraction has 426 states and 710 transitions. [2018-12-02 12:39:20,768 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 12:39:20,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 426 states and 710 transitions. [2018-12-02 12:39:20,770 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 380 [2018-12-02 12:39:20,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:20,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:20,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-02 12:39:20,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 12:39:20,771 INFO L794 eck$LassoCheckResult]: Stem: 4543#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 4493#L-1 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;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;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; 4494#L116-2 assume !(add_history_type_~var~0 < 3); 4591#L116-3 add_history_type_#res := 1; 4537#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 4399#L255 assume !(0 == init_~tmp~1);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; 4400#L116-6 [2018-12-02 12:39:20,771 INFO L796 eck$LassoCheckResult]: Loop: 4400#L116-6 assume !!(add_history_type_~var~0 < 3); 4599#L117-2 assume !(0 == add_history_type_~history_id); 4486#L123-2 assume !(1 == add_history_type_~history_id); 4488#L129-2 assume !(2 == add_history_type_~history_id); 4465#L135-3 assume !(3 == add_history_type_~history_id); 4215#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 4400#L116-6 [2018-12-02 12:39:20,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:20,772 INFO L82 PathProgramCache]: Analyzing trace with hash 889868154, now seen corresponding path program 1 times [2018-12-02 12:39:20,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:20,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:20,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:20,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:20,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:20,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:20,796 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:20,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 261434407, now seen corresponding path program 1 times [2018-12-02 12:39:20,796 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:20,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:20,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:20,826 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:20,826 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:20,826 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:20,826 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:20,827 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:20,827 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:20,827 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:20,827 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:20,827 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-12-02 12:39:20,827 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:20,827 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:20,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,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-12-02 12:39:20,932 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:20,932 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,935 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,935 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,937 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,937 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,953 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,953 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,968 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,968 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,971 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:20,973 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:20,973 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:20,988 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:20,988 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:21,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:21,003 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:21,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:21,020 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:21,020 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,024 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:21,024 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:21,026 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:21,026 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,042 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:21,042 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:21,044 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:21,044 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,060 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:21,060 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,076 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:39:21,076 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:21,093 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 12:39:21,094 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:21,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:21,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:21,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:21,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:39:21,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:21,095 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:21,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:21,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration2_Loop [2018-12-02 12:39:21,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:21,095 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:21,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,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-12-02 12:39:21,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,214 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:21,214 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:39:21,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:21,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:21,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:21,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:21,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:21,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:21,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,218 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:21,218 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:21,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:21,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-12-02 12:39:21,221 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,221 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,223 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:21,223 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:21,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:21,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:21,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,226 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:21,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:21,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:21,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:21,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:21,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:21,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:21,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:39:21,235 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:39:21,235 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:39:21,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:39:21,236 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:39:21,236 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:39:21,236 INFO L520 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-12-02 12:39:21,236 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:39:21,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:21,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:21,273 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-12-02 12:39:21,273 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 426 states and 710 transitions. cyclomatic complexity: 292 Second operand 3 states. [2018-12-02 12:39:21,328 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 426 states and 710 transitions. cyclomatic complexity: 292. Second operand 3 states. Result 1567 states and 2585 transitions. Complement of second has 7 states. [2018-12-02 12:39:21,328 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-12-02 12:39:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 12:39:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1191 transitions. [2018-12-02 12:39:21,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1191 transitions. Stem has 6 letters. Loop has 6 letters. [2018-12-02 12:39:21,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:21,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1191 transitions. Stem has 12 letters. Loop has 6 letters. [2018-12-02 12:39:21,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:21,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1191 transitions. Stem has 6 letters. Loop has 12 letters. [2018-12-02 12:39:21,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:21,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1567 states and 2585 transitions. [2018-12-02 12:39:21,338 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 970 [2018-12-02 12:39:21,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1567 states to 1128 states and 1860 transitions. [2018-12-02 12:39:21,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1054 [2018-12-02 12:39:21,345 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1057 [2018-12-02 12:39:21,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1128 states and 1860 transitions. [2018-12-02 12:39:21,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:21,345 INFO L705 BuchiCegarLoop]: Abstraction has 1128 states and 1860 transitions. [2018-12-02 12:39:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states and 1860 transitions. [2018-12-02 12:39:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 478. [2018-12-02 12:39:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2018-12-02 12:39:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 795 transitions. [2018-12-02 12:39:21,355 INFO L728 BuchiCegarLoop]: Abstraction has 478 states and 795 transitions. [2018-12-02 12:39:21,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:21,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:21,355 INFO L87 Difference]: Start difference. First operand 478 states and 795 transitions. Second operand 3 states. [2018-12-02 12:39:21,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:21,385 INFO L93 Difference]: Finished difference Result 939 states and 1557 transitions. [2018-12-02 12:39:21,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:21,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 939 states and 1557 transitions. [2018-12-02 12:39:21,388 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 540 [2018-12-02 12:39:21,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 939 states to 939 states and 1557 transitions. [2018-12-02 12:39:21,391 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 801 [2018-12-02 12:39:21,392 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 801 [2018-12-02 12:39:21,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 939 states and 1557 transitions. [2018-12-02 12:39:21,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:21,392 INFO L705 BuchiCegarLoop]: Abstraction has 939 states and 1557 transitions. [2018-12-02 12:39:21,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states and 1557 transitions. [2018-12-02 12:39:21,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 480. [2018-12-02 12:39:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-12-02 12:39:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 795 transitions. [2018-12-02 12:39:21,398 INFO L728 BuchiCegarLoop]: Abstraction has 480 states and 795 transitions. [2018-12-02 12:39:21,398 INFO L608 BuchiCegarLoop]: Abstraction has 480 states and 795 transitions. [2018-12-02 12:39:21,398 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 12:39:21,398 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 795 transitions. [2018-12-02 12:39:21,400 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2018-12-02 12:39:21,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:21,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:21,401 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:21,401 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] [2018-12-02 12:39:21,401 INFO L794 eck$LassoCheckResult]: Stem: 8056#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 7996#L-1 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;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;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; 7997#L116-2 assume !!(add_history_type_~var~0 < 3); 8095#L117 assume 0 == add_history_type_~history_id;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; 7746#L171 assume 0 == read_history_bool_~history_id; 7747#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7753#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 7879#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8048#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 7897#L255 assume 0 == init_~tmp~1;init_#res := 0; 7779#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 7781#L558-2 [2018-12-02 12:39:21,402 INFO L796 eck$LassoCheckResult]: Loop: 7781#L558-2 assume !!(main_~i2~0 < 10);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;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; 7770#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7771#L578-16 assume 0 != ~gate1Failed~0 % 256; 7764#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 7765#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; 7782#L409 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;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; 7743#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7745#L578-17 assume 0 != ~gate2Failed~0 % 256; 7720#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 7710#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; 7711#L440 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;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; 8058#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 7848#L578-18 assume 0 != ~gate3Failed~0 % 256; 7906#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 7890#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; 7891#L471 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; 7902#L486 assume ~VALUE1~0 == ~VALUE2~0; 7904#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 7659#L578-19 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; 7979#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 7953#L578-20 ~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;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; 8108#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 7974#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 7975#L171-12 assume 0 == read_history_bool_~history_id; 8090#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 7813#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 7850#L307 assume !(0 == check_~tmp___3~0 % 256); 7950#L307-1 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; 8005#L151-7 assume 3 == read_history_int8_~history_id; 8020#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7922#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 7886#L346 assume !(check_~tmp___10~0 > -2); 7870#L346-1 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; 7871#L151-9 assume 3 == read_history_int8_~history_id; 8015#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 7917#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 7967#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 7885#L366-1 check_#res := 1; 7721#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 7722#L583-72 assume !(0 == assert_~arg % 256); 7896#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 7781#L558-2 [2018-12-02 12:39:21,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1494216267, now seen corresponding path program 1 times [2018-12-02 12:39:21,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:21,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:21,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:21,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:21,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:21,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:39:21,419 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:21,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,419 INFO L82 PathProgramCache]: Analyzing trace with hash -869440768, now seen corresponding path program 1 times [2018-12-02 12:39:21,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:21,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:21,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:21,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:21,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:21,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:21,434 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:21,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:21,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:21,435 INFO L87 Difference]: Start difference. First operand 480 states and 795 transitions. cyclomatic complexity: 323 Second operand 3 states. [2018-12-02 12:39:21,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:21,448 INFO L93 Difference]: Finished difference Result 481 states and 795 transitions. [2018-12-02 12:39:21,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:21,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 481 states and 795 transitions. [2018-12-02 12:39:21,450 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2018-12-02 12:39:21,452 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 481 states to 480 states and 791 transitions. [2018-12-02 12:39:21,452 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 409 [2018-12-02 12:39:21,453 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 409 [2018-12-02 12:39:21,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 480 states and 791 transitions. [2018-12-02 12:39:21,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:21,453 INFO L705 BuchiCegarLoop]: Abstraction has 480 states and 791 transitions. [2018-12-02 12:39:21,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states and 791 transitions. [2018-12-02 12:39:21,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 480. [2018-12-02 12:39:21,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-12-02 12:39:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 791 transitions. [2018-12-02 12:39:21,460 INFO L728 BuchiCegarLoop]: Abstraction has 480 states and 791 transitions. [2018-12-02 12:39:21,460 INFO L608 BuchiCegarLoop]: Abstraction has 480 states and 791 transitions. [2018-12-02 12:39:21,460 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 12:39:21,460 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 480 states and 791 transitions. [2018-12-02 12:39:21,461 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 325 [2018-12-02 12:39:21,461 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:21,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:21,462 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] [2018-12-02 12:39:21,462 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 12:39:21,463 INFO L794 eck$LassoCheckResult]: Stem: 9024#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 8966#L-1 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;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;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; 8967#L116-2 assume !!(add_history_type_~var~0 < 3); 9063#L117 assume 0 == add_history_type_~history_id;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; 8715#L171 assume 0 == read_history_bool_~history_id; 8716#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8726#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8848#L119 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 9018#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 8866#L255 assume !(0 == init_~tmp~1);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; 8867#L116-6 assume !!(add_history_type_~var~0 < 3); 9086#L117-2 assume 0 == add_history_type_~history_id;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; 9052#L171-3 assume 0 == read_history_bool_~history_id; 9055#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 8709#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 8812#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 8660#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 8746#L259 assume !(0 == init_~tmp___0~1);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; 8747#L116-10 assume !!(add_history_type_~var~0 < 3); 9080#L117-4 [2018-12-02 12:39:21,463 INFO L796 eck$LassoCheckResult]: Loop: 9080#L117-4 assume !(0 == add_history_type_~history_id); 8953#L123-4 assume !(1 == add_history_type_~history_id); 8955#L129-4 assume !(2 == add_history_type_~history_id); 8929#L135-6 assume !(3 == add_history_type_~history_id); 8652#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 9089#L116-10 assume !!(add_history_type_~var~0 < 3); 9080#L117-4 [2018-12-02 12:39:21,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,463 INFO L82 PathProgramCache]: Analyzing trace with hash 576829260, now seen corresponding path program 1 times [2018-12-02 12:39:21,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:21,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:21,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:21,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:21,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:21,492 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:21,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1197341531, now seen corresponding path program 1 times [2018-12-02 12:39:21,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:21,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:21,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:21,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:21,509 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:21,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:21,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:21,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:21,510 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:21,510 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:21,510 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:21,510 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:21,510 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-12-02 12:39:21,510 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:21,510 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:21,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-12-02 12:39:21,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,617 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:21,617 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,619 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:21,619 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:21,636 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:39:21,636 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:21,683 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 12:39:21,684 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:21,685 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:21,685 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:21,685 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:21,685 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:39:21,685 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:21,685 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:21,685 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:21,685 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration4_Loop [2018-12-02 12:39:21,685 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:21,685 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,780 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:21,780 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:39:21,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-12-02 12:39:21,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:21,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:21,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:21,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-12-02 12:39:21,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:21,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:21,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:21,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:21,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:21,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:21,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:21,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:39:21,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:39:21,787 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:39:21,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:39:21,787 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:39:21,787 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:39:21,787 INFO L520 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-12-02 12:39:21,787 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:39:21,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:21,837 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-12-02 12:39:21,837 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 480 states and 791 transitions. cyclomatic complexity: 319 Second operand 4 states. [2018-12-02 12:39:21,861 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 480 states and 791 transitions. cyclomatic complexity: 319. Second operand 4 states. Result 541 states and 893 transitions. Complement of second has 7 states. [2018-12-02 12:39:21,861 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-12-02 12:39:21,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 12:39:21,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 221 transitions. [2018-12-02 12:39:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 6 letters. [2018-12-02 12:39:21,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 25 letters. Loop has 6 letters. [2018-12-02 12:39:21,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:21,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 221 transitions. Stem has 19 letters. Loop has 12 letters. [2018-12-02 12:39:21,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:21,862 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 541 states and 893 transitions. [2018-12-02 12:39:21,864 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2018-12-02 12:39:21,865 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 541 states to 536 states and 884 transitions. [2018-12-02 12:39:21,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 408 [2018-12-02 12:39:21,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 410 [2018-12-02 12:39:21,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 884 transitions. [2018-12-02 12:39:21,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:21,866 INFO L705 BuchiCegarLoop]: Abstraction has 536 states and 884 transitions. [2018-12-02 12:39:21,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 884 transitions. [2018-12-02 12:39:21,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 532. [2018-12-02 12:39:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-12-02 12:39:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 880 transitions. [2018-12-02 12:39:21,871 INFO L728 BuchiCegarLoop]: Abstraction has 532 states and 880 transitions. [2018-12-02 12:39:21,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:39:21,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:39:21,871 INFO L87 Difference]: Start difference. First operand 532 states and 880 transitions. Second operand 4 states. [2018-12-02 12:39:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:21,908 INFO L93 Difference]: Finished difference Result 756 states and 1241 transitions. [2018-12-02 12:39:21,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:39:21,908 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 756 states and 1241 transitions. [2018-12-02 12:39:21,910 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 485 [2018-12-02 12:39:21,912 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 756 states to 740 states and 1215 transitions. [2018-12-02 12:39:21,912 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 614 [2018-12-02 12:39:21,913 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 614 [2018-12-02 12:39:21,913 INFO L73 IsDeterministic]: Start isDeterministic. Operand 740 states and 1215 transitions. [2018-12-02 12:39:21,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:21,913 INFO L705 BuchiCegarLoop]: Abstraction has 740 states and 1215 transitions. [2018-12-02 12:39:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states and 1215 transitions. [2018-12-02 12:39:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 518. [2018-12-02 12:39:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-12-02 12:39:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 855 transitions. [2018-12-02 12:39:21,918 INFO L728 BuchiCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-12-02 12:39:21,918 INFO L608 BuchiCegarLoop]: Abstraction has 518 states and 855 transitions. [2018-12-02 12:39:21,918 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 12:39:21,918 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 518 states and 855 transitions. [2018-12-02 12:39:21,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 270 [2018-12-02 12:39:21,921 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:21,921 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:21,921 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:21,921 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-02 12:39:21,922 INFO L794 eck$LassoCheckResult]: Stem: 11464#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 11400#L-1 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;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;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; 11401#L116-2 assume !!(add_history_type_~var~0 < 3); 11511#L117 assume 0 == add_history_type_~history_id;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; 11138#L171 assume 0 == read_history_bool_~history_id; 11139#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11142#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11277#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 11354#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11355#L116-2 assume !(add_history_type_~var~0 < 3); 11526#L116-3 add_history_type_#res := 1; 11460#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 11294#L255 assume !(0 == init_~tmp~1);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; 11295#L116-6 assume !!(add_history_type_~var~0 < 3); 11535#L117-2 assume 0 == add_history_type_~history_id;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; 11499#L171-3 assume 0 == read_history_bool_~history_id; 11502#L172-3 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11132#L203-3 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11235#L119-1 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11072#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 11163#L259 assume !(0 == init_~tmp___0~1);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; 11164#L116-10 assume !!(add_history_type_~var~0 < 3); 11490#L117-4 assume 0 == add_history_type_~history_id;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; 11492#L171-6 assume 0 == read_history_bool_~history_id; 11488#L172-6 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 11170#L203-6 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 11210#L119-2 assume !(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 11061#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 11398#L263 assume !(0 == init_~tmp___1~1);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; 11399#L116-14 assume !!(add_history_type_~var~0 < 3); 11518#L117-6 [2018-12-02 12:39:21,922 INFO L796 eck$LassoCheckResult]: Loop: 11518#L117-6 assume !(0 == add_history_type_~history_id); 11382#L123-6 assume !(1 == add_history_type_~history_id); 11384#L129-6 assume !(2 == add_history_type_~history_id); 11111#L135-9 assume !(3 == add_history_type_~history_id); 11053#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 11110#L116-14 assume !!(add_history_type_~var~0 < 3); 11518#L117-6 [2018-12-02 12:39:21,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,922 INFO L82 PathProgramCache]: Analyzing trace with hash -2009806385, now seen corresponding path program 1 times [2018-12-02 12:39:21,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:21,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:21,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:21,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:21,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:21,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:21,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:39:21,949 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:21,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 180771675, now seen corresponding path program 1 times [2018-12-02 12:39:21,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:21,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:21,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:21,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:21,970 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:21,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:21,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:21,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:21,970 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:21,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:21,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:21,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:21,971 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-12-02 12:39:21,971 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:21,971 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:21,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-12-02 12:39: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-12-02 12:39:21,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-12-02 12:39: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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39:21,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-12-02 12:39: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-12-02 12:39: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-12-02 12:39:21,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39: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-12-02 12:39:22,087 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:22,087 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,093 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,093 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,116 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,116 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,135 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,139 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,178 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,178 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,180 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,181 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,183 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,183 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,198 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,212 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,215 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,215 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,217 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,217 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_add_history_type_~history_id=7} Honda state: {ULTIMATE.start_add_history_type_~history_id=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,232 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,232 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,234 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,234 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,252 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,252 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,255 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:22,255 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,269 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:22,269 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:22,294 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:39:22,294 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:22,345 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 12:39:22,346 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:22,346 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:22,346 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:22,346 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:22,346 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:39:22,346 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:22,346 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:22,347 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:22,347 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration5_Loop [2018-12-02 12:39:22,347 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:22,347 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:22,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:22,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:22,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:22,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:22,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-12-02 12:39:22,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-12-02 12:39:22,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-12-02 12:39:22,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-12-02 12:39:22,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-12-02 12:39:22,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-12-02 12:39:22,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:22,483 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:22,483 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:39:22,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-12-02 12:39:22,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:22,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:22,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,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-12-02 12:39:22,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:22,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:22,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:22,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,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-12-02 12:39:22,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:22,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:22,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,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-12-02 12:39:22,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:22,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 12:39:22,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 12:39:22,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:22,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,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-12-02 12:39:22,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:22,497 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:22,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:22,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:22,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:22,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:22,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:22,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:22,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,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-12-02 12:39:22,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,508 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:22,508 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:22,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:22,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:22,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:22,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:22,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:22,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:22,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:22,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:22,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:22,513 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:39:22,514 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:39:22,514 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:39:22,515 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:39:22,515 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:39:22,515 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:39:22,515 INFO L520 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-12-02 12:39:22,515 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:39:22,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:22,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:22,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:22,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:22,578 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-12-02 12:39:22,578 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 518 states and 855 transitions. cyclomatic complexity: 345 Second operand 4 states. [2018-12-02 12:39:22,614 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 518 states and 855 transitions. cyclomatic complexity: 345. Second operand 4 states. Result 1227 states and 2021 transitions. Complement of second has 6 states. [2018-12-02 12:39:22,614 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-12-02 12:39:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 12:39:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1024 transitions. [2018-12-02 12:39:22,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1024 transitions. Stem has 30 letters. Loop has 6 letters. [2018-12-02 12:39:22,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:22,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1024 transitions. Stem has 36 letters. Loop has 6 letters. [2018-12-02 12:39:22,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:22,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 1024 transitions. Stem has 30 letters. Loop has 12 letters. [2018-12-02 12:39:22,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:22,616 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1227 states and 2021 transitions. [2018-12-02 12:39:22,621 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 430 [2018-12-02 12:39:22,625 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1227 states to 790 states and 1302 transitions. [2018-12-02 12:39:22,625 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 607 [2018-12-02 12:39:22,625 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 609 [2018-12-02 12:39:22,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 790 states and 1302 transitions. [2018-12-02 12:39:22,626 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:22,626 INFO L705 BuchiCegarLoop]: Abstraction has 790 states and 1302 transitions. [2018-12-02 12:39:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states and 1302 transitions. [2018-12-02 12:39:22,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 570. [2018-12-02 12:39:22,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-12-02 12:39:22,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 944 transitions. [2018-12-02 12:39:22,635 INFO L728 BuchiCegarLoop]: Abstraction has 570 states and 944 transitions. [2018-12-02 12:39:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:39:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:39:22,635 INFO L87 Difference]: Start difference. First operand 570 states and 944 transitions. Second operand 5 states. [2018-12-02 12:39:22,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:22,707 INFO L93 Difference]: Finished difference Result 704 states and 1146 transitions. [2018-12-02 12:39:22,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 12:39:22,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 704 states and 1146 transitions. [2018-12-02 12:39:22,709 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 430 [2018-12-02 12:39:22,711 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 704 states to 704 states and 1146 transitions. [2018-12-02 12:39:22,711 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 571 [2018-12-02 12:39:22,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 571 [2018-12-02 12:39:22,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 704 states and 1146 transitions. [2018-12-02 12:39:22,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:22,711 INFO L705 BuchiCegarLoop]: Abstraction has 704 states and 1146 transitions. [2018-12-02 12:39:22,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states and 1146 transitions. [2018-12-02 12:39:22,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 482. [2018-12-02 12:39:22,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-12-02 12:39:22,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 786 transitions. [2018-12-02 12:39:22,716 INFO L728 BuchiCegarLoop]: Abstraction has 482 states and 786 transitions. [2018-12-02 12:39:22,716 INFO L608 BuchiCegarLoop]: Abstraction has 482 states and 786 transitions. [2018-12-02 12:39:22,716 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 12:39:22,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 786 transitions. [2018-12-02 12:39:22,717 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2018-12-02 12:39:22,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:22,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:22,718 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:22,718 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] [2018-12-02 12:39:22,718 INFO L794 eck$LassoCheckResult]: Stem: 14466#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 14206#L-1 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;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;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; 14207#L116-2 assume !!(add_history_type_~var~0 < 3); 14584#L117 assume 0 == add_history_type_~history_id;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; 14411#L171 assume 0 == read_history_bool_~history_id; 14412#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14179#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 14385#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 14386#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 14620#L116-2 assume !(add_history_type_~var~0 < 3); 14617#L116-3 add_history_type_#res := 1; 14436#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 14437#L255 assume !(0 == init_~tmp~1);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; 14564#L116-6 assume !!(add_history_type_~var~0 < 3); 14559#L117-2 assume !(0 == add_history_type_~history_id); 14560#L123-2 assume 1 == add_history_type_~history_id;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; 14618#L171-4 assume 0 == read_history_bool_~history_id; 14557#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14223#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14260#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14234#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 14430#L259 assume !(0 == init_~tmp___0~1);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; 14431#L116-10 assume !!(add_history_type_~var~0 < 3); 14549#L117-4 assume !(0 == add_history_type_~history_id); 14550#L123-4 assume 1 == add_history_type_~history_id;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; 14639#L171-7 assume 0 == read_history_bool_~history_id; 14542#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14309#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14255#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14227#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 14189#L263 assume !(0 == init_~tmp___1~1);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; 14190#L116-14 assume !!(add_history_type_~var~0 < 3); 14538#L117-6 assume !(0 == add_history_type_~history_id); 14540#L123-6 assume 1 == add_history_type_~history_id;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; 14632#L171-10 assume 0 == read_history_bool_~history_id; 14572#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14288#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 14246#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 14215#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 14467#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 14433#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 14434#L558-2 [2018-12-02 12:39:22,718 INFO L796 eck$LassoCheckResult]: Loop: 14434#L558-2 assume !!(main_~i2~0 < 10);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;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; 14425#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14426#L578-16 assume 0 != ~gate1Failed~0 % 256; 14419#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 14420#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; 14435#L409 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;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; 14408#L226-2 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14410#L578-17 assume 0 != ~gate2Failed~0 % 256; 14339#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 14291#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; 14266#L440 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;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; 14479#L226-4 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 14469#L578-18 assume 0 != ~gate3Failed~0 % 256; 14577#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 14545#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; 14546#L471 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; 14574#L486 assume ~VALUE1~0 == ~VALUE2~0; 14576#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 14204#L578-19 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; 14641#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 14612#L578-20 ~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;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; 14613#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 14461#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 14623#L171-12 assume 0 == read_history_bool_~history_id; 14567#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 14341#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 14219#L307 assume !(0 == check_~tmp___3~0 % 256); 14221#L307-1 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; 14231#L151-7 assume 3 == read_history_int8_~history_id; 14304#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14305#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 14307#L346 assume !(check_~tmp___10~0 > -2); 14515#L346-1 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; 14516#L151-9 assume 3 == read_history_int8_~history_id; 14292#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 14293#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 14295#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 14363#L366-1 check_#res := 1; 14353#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 14354#L583-72 assume !(0 == assert_~arg % 256); 14563#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 14434#L558-2 [2018-12-02 12:39:22,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 1 times [2018-12-02 12:39:22,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:39:22,745 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:22,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:22,745 INFO L82 PathProgramCache]: Analyzing trace with hash -869440768, now seen corresponding path program 2 times [2018-12-02 12:39:22,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:22,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:22,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:22,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:22,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:22,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:22,759 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:22,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:22,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:22,759 INFO L87 Difference]: Start difference. First operand 482 states and 786 transitions. cyclomatic complexity: 309 Second operand 3 states. [2018-12-02 12:39:22,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:22,774 INFO L93 Difference]: Finished difference Result 493 states and 800 transitions. [2018-12-02 12:39:22,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:22,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 493 states and 800 transitions. [2018-12-02 12:39:22,776 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 225 [2018-12-02 12:39:22,777 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 493 states to 493 states and 800 transitions. [2018-12-02 12:39:22,777 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 360 [2018-12-02 12:39:22,777 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 360 [2018-12-02 12:39:22,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 493 states and 800 transitions. [2018-12-02 12:39:22,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:22,778 INFO L705 BuchiCegarLoop]: Abstraction has 493 states and 800 transitions. [2018-12-02 12:39:22,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states and 800 transitions. [2018-12-02 12:39:22,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 482. [2018-12-02 12:39:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2018-12-02 12:39:22,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 784 transitions. [2018-12-02 12:39:22,782 INFO L728 BuchiCegarLoop]: Abstraction has 482 states and 784 transitions. [2018-12-02 12:39:22,782 INFO L608 BuchiCegarLoop]: Abstraction has 482 states and 784 transitions. [2018-12-02 12:39:22,782 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 12:39:22,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 482 states and 784 transitions. [2018-12-02 12:39:22,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 215 [2018-12-02 12:39:22,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:22,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:22,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:22,784 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] [2018-12-02 12:39:22,785 INFO L794 eck$LassoCheckResult]: Stem: 15450#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 15190#L-1 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;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;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; 15191#L116-2 assume !!(add_history_type_~var~0 < 3); 15568#L117 assume 0 == add_history_type_~history_id;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; 15394#L171 assume 0 == read_history_bool_~history_id; 15395#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15163#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 15369#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 15370#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 15604#L116-2 assume !(add_history_type_~var~0 < 3); 15601#L116-3 add_history_type_#res := 1; 15419#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 15420#L255 assume !(0 == init_~tmp~1);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; 15548#L116-6 assume !!(add_history_type_~var~0 < 3); 15543#L117-2 assume !(0 == add_history_type_~history_id); 15544#L123-2 assume 1 == add_history_type_~history_id;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; 15602#L171-4 assume 0 == read_history_bool_~history_id; 15541#L172-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15207#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15244#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15218#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 15413#L259 assume !(0 == init_~tmp___0~1);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; 15414#L116-10 assume !!(add_history_type_~var~0 < 3); 15533#L117-4 assume !(0 == add_history_type_~history_id); 15534#L123-4 assume 1 == add_history_type_~history_id;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; 15622#L171-7 assume 0 == read_history_bool_~history_id; 15526#L172-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15293#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15239#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15211#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 15173#L263 assume !(0 == init_~tmp___1~1);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; 15174#L116-14 assume !!(add_history_type_~var~0 < 3); 15522#L117-6 assume !(0 == add_history_type_~history_id); 15524#L123-6 assume 1 == add_history_type_~history_id;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; 15615#L171-10 assume 0 == read_history_bool_~history_id; 15556#L172-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15272#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 15230#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 15199#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 15451#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 15416#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 15417#L558-2 [2018-12-02 12:39:22,785 INFO L796 eck$LassoCheckResult]: Loop: 15417#L558-2 assume !!(main_~i2~0 < 10);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;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; 15408#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 15409#L578-16 assume 0 != ~gate1Failed~0 % 256; 15402#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 15403#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; 15418#L409 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;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; 15392#L226-2 assume !(0 == write_history_bool_~history_id); 15393#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 15425#L578-17 assume 0 != ~gate2Failed~0 % 256; 15323#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 15275#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; 15250#L440 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;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; 15463#L226-4 assume !(0 == write_history_bool_~history_id); 15452#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 15453#L578-18 assume 0 != ~gate3Failed~0 % 256; 15561#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 15529#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; 15530#L471 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; 15558#L486 assume ~VALUE1~0 == ~VALUE2~0; 15560#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 15188#L578-19 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; 15624#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 15596#L578-20 ~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;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; 15597#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 15445#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 15607#L171-12 assume 0 == read_history_bool_~history_id; 15551#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 15325#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 15203#L307 assume !(0 == check_~tmp___3~0 % 256); 15205#L307-1 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; 15215#L151-7 assume 3 == read_history_int8_~history_id; 15288#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15289#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 15291#L346 assume !(check_~tmp___10~0 > -2); 15499#L346-1 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; 15500#L151-9 assume 3 == read_history_int8_~history_id; 15276#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 15277#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 15279#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 15347#L366-1 check_#res := 1; 15337#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 15338#L583-72 assume !(0 == assert_~arg % 256); 15547#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 15417#L558-2 [2018-12-02 12:39:22,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 317959147, now seen corresponding path program 2 times [2018-12-02 12:39:22,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:22,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:22,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:22,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 12:39:22,812 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:22,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1861050743, now seen corresponding path program 1 times [2018-12-02 12:39:22,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:22,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:22,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:22,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:22,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:22,825 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:39:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:39:22,825 INFO L87 Difference]: Start difference. First operand 482 states and 784 transitions. cyclomatic complexity: 307 Second operand 5 states. [2018-12-02 12:39:22,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:22,990 INFO L93 Difference]: Finished difference Result 994 states and 1539 transitions. [2018-12-02 12:39:22,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 12:39:22,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 994 states and 1539 transitions. [2018-12-02 12:39:22,992 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 640 [2018-12-02 12:39:22,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 994 states to 994 states and 1539 transitions. [2018-12-02 12:39:22,995 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 829 [2018-12-02 12:39:22,995 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 829 [2018-12-02 12:39:22,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 994 states and 1539 transitions. [2018-12-02 12:39:22,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:22,995 INFO L705 BuchiCegarLoop]: Abstraction has 994 states and 1539 transitions. [2018-12-02 12:39:22,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states and 1539 transitions. [2018-12-02 12:39:23,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 450. [2018-12-02 12:39:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 12:39:23,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 704 transitions. [2018-12-02 12:39:23,000 INFO L728 BuchiCegarLoop]: Abstraction has 450 states and 704 transitions. [2018-12-02 12:39:23,000 INFO L608 BuchiCegarLoop]: Abstraction has 450 states and 704 transitions. [2018-12-02 12:39:23,000 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 12:39:23,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 704 transitions. [2018-12-02 12:39:23,001 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 207 [2018-12-02 12:39:23,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,002 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,002 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] [2018-12-02 12:39:23,002 INFO L794 eck$LassoCheckResult]: Stem: 16940#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 16684#L-1 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;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;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; 16685#L116-2 assume !!(add_history_type_~var~0 < 3); 17033#L117 assume 0 == add_history_type_~history_id;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; 16884#L171 assume 0 == read_history_bool_~history_id; 16885#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16660#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 16859#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 16860#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 17066#L116-2 assume !(add_history_type_~var~0 < 3); 17063#L116-3 add_history_type_#res := 1; 16910#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 16911#L255 assume !(0 == init_~tmp~1);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; 17020#L116-6 assume !!(add_history_type_~var~0 < 3); 17015#L117-2 assume !(0 == add_history_type_~history_id); 17016#L123-2 assume 1 == add_history_type_~history_id;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; 17064#L171-4 assume !(0 == read_history_bool_~history_id); 16954#L181-4 assume 1 == read_history_bool_~history_id; 16955#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16839#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16730#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16704#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 16903#L259 assume !(0 == init_~tmp___0~1);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; 16904#L116-10 assume !!(add_history_type_~var~0 < 3); 17009#L117-4 assume !(0 == add_history_type_~history_id); 17010#L123-4 assume 1 == add_history_type_~history_id;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; 17084#L171-7 assume !(0 == read_history_bool_~history_id); 16982#L181-7 assume 1 == read_history_bool_~history_id; 16983#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16782#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16725#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16697#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 16667#L263 assume !(0 == init_~tmp___1~1);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; 16668#L116-14 assume !!(add_history_type_~var~0 < 3); 17000#L117-6 assume !(0 == add_history_type_~history_id); 17002#L123-6 assume 1 == add_history_type_~history_id;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; 17077#L171-10 assume !(0 == read_history_bool_~history_id); 16970#L181-10 assume 1 == read_history_bool_~history_id; 16971#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 16761#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 16716#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 16689#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 16941#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 16906#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 16907#L558-2 [2018-12-02 12:39:23,002 INFO L796 eck$LassoCheckResult]: Loop: 16907#L558-2 assume !!(main_~i2~0 < 10);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;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; 16898#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 16899#L578-16 assume 0 != ~gate1Failed~0 % 256; 16892#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 16893#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; 16908#L409 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;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; 16882#L226-2 assume !(0 == write_history_bool_~history_id); 16883#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16917#L578-17 assume 0 != ~gate2Failed~0 % 256; 16814#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 16764#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; 16736#L440 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;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; 16953#L226-4 assume !(0 == write_history_bool_~history_id); 16942#L231-4 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 16943#L578-18 assume 0 != ~gate3Failed~0 % 256; 17030#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17007#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; 17008#L471 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; 17025#L486 assume ~VALUE1~0 == ~VALUE2~0; 17027#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 16682#L578-19 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; 17086#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17058#L578-20 ~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;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; 17059#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 16935#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 17069#L171-12 assume 0 == read_history_bool_~history_id; 17022#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 16816#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 16693#L307 assume !(0 == check_~tmp___3~0 % 256); 16695#L307-1 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; 16701#L151-7 assume 3 == read_history_int8_~history_id; 16774#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16775#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 16777#L346 assume !(check_~tmp___10~0 > -2); 16988#L346-1 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; 16989#L151-9 assume 3 == read_history_int8_~history_id; 16757#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 16758#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 16765#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 16835#L366-1 check_#res := 1; 16825#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 16826#L583-72 assume !(0 == assert_~arg % 256); 17019#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 16907#L558-2 [2018-12-02 12:39:23,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 1 times [2018-12-02 12:39:23,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:23,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:23,019 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1861050743, now seen corresponding path program 2 times [2018-12-02 12:39:23,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,033 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,034 INFO L87 Difference]: Start difference. First operand 450 states and 704 transitions. cyclomatic complexity: 259 Second operand 3 states. [2018-12-02 12:39:23,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,050 INFO L93 Difference]: Finished difference Result 471 states and 734 transitions. [2018-12-02 12:39:23,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 471 states and 734 transitions. [2018-12-02 12:39:23,052 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 227 [2018-12-02 12:39:23,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 471 states to 471 states and 734 transitions. [2018-12-02 12:39:23,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2018-12-02 12:39:23,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2018-12-02 12:39:23,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 471 states and 734 transitions. [2018-12-02 12:39:23,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,055 INFO L705 BuchiCegarLoop]: Abstraction has 471 states and 734 transitions. [2018-12-02 12:39:23,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states and 734 transitions. [2018-12-02 12:39:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 450. [2018-12-02 12:39:23,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-12-02 12:39:23,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 703 transitions. [2018-12-02 12:39:23,060 INFO L728 BuchiCegarLoop]: Abstraction has 450 states and 703 transitions. [2018-12-02 12:39:23,060 INFO L608 BuchiCegarLoop]: Abstraction has 450 states and 703 transitions. [2018-12-02 12:39:23,061 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 12:39:23,061 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 450 states and 703 transitions. [2018-12-02 12:39:23,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 207 [2018-12-02 12:39:23,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,063 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,063 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] [2018-12-02 12:39:23,063 INFO L794 eck$LassoCheckResult]: Stem: 17869#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 17613#L-1 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;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;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; 17614#L116-2 assume !!(add_history_type_~var~0 < 3); 17962#L117 assume 0 == add_history_type_~history_id;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; 17813#L171 assume 0 == read_history_bool_~history_id; 17814#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17589#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 17788#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 17789#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 17996#L116-2 assume !(add_history_type_~var~0 < 3); 17992#L116-3 add_history_type_#res := 1; 17839#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 17840#L255 assume !(0 == init_~tmp~1);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; 17949#L116-6 assume !!(add_history_type_~var~0 < 3); 17944#L117-2 assume !(0 == add_history_type_~history_id); 17945#L123-2 assume 1 == add_history_type_~history_id;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; 17993#L171-4 assume !(0 == read_history_bool_~history_id); 17882#L181-4 assume 1 == read_history_bool_~history_id; 17883#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17768#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17659#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17633#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 17832#L259 assume !(0 == init_~tmp___0~1);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; 17833#L116-10 assume !!(add_history_type_~var~0 < 3); 17938#L117-4 assume !(0 == add_history_type_~history_id); 17939#L123-4 assume 1 == add_history_type_~history_id;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; 18014#L171-7 assume !(0 == read_history_bool_~history_id); 17911#L181-7 assume 1 == read_history_bool_~history_id; 17912#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17711#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17654#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17627#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 17596#L263 assume !(0 == init_~tmp___1~1);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; 17597#L116-14 assume !!(add_history_type_~var~0 < 3); 17929#L117-6 assume !(0 == add_history_type_~history_id); 17931#L123-6 assume 1 == add_history_type_~history_id;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; 18006#L171-10 assume !(0 == read_history_bool_~history_id); 17899#L181-10 assume 1 == read_history_bool_~history_id; 17900#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 17690#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 17645#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 17621#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 17870#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 17835#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 17836#L558-2 [2018-12-02 12:39:23,063 INFO L796 eck$LassoCheckResult]: Loop: 17836#L558-2 assume !!(main_~i2~0 < 10);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;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; 17827#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 17828#L578-16 assume 0 != ~gate1Failed~0 % 256; 17821#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 17822#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; 17837#L409 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;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; 17811#L226-2 assume !(0 == write_history_bool_~history_id); 17812#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 17846#L578-17 assume 0 != ~gate2Failed~0 % 256; 17745#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 17693#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; 17665#L440 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;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; 17881#L226-4 assume !(0 == write_history_bool_~history_id); 17871#L231-4 assume !(1 == write_history_bool_~history_id); 17872#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 17890#L578-18 assume 0 != ~gate3Failed~0 % 256; 17957#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 17934#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; 17935#L471 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; 17954#L486 assume ~VALUE1~0 == ~VALUE2~0; 17956#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 17605#L578-19 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; 18013#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 17986#L578-20 ~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;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; 17987#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 17864#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 17998#L171-12 assume 0 == read_history_bool_~history_id; 17951#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 17741#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 17617#L307 assume !(0 == check_~tmp___3~0 % 256); 17619#L307-1 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; 17625#L151-7 assume 3 == read_history_int8_~history_id; 17699#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17700#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 17706#L346 assume !(check_~tmp___10~0 > -2); 17917#L346-1 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; 17918#L151-9 assume 3 == read_history_int8_~history_id; 17686#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 17687#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 17694#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 17764#L366-1 check_#res := 1; 17754#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 17755#L583-72 assume !(0 == assert_~arg % 256); 17948#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 17836#L558-2 [2018-12-02 12:39:23,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 2 times [2018-12-02 12:39:23,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,065 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:23,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:23,083 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1004280697, now seen corresponding path program 1 times [2018-12-02 12:39:23,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,104 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,104 INFO L87 Difference]: Start difference. First operand 450 states and 703 transitions. cyclomatic complexity: 258 Second operand 3 states. [2018-12-02 12:39:23,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,117 INFO L93 Difference]: Finished difference Result 642 states and 1007 transitions. [2018-12-02 12:39:23,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,118 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 642 states and 1007 transitions. [2018-12-02 12:39:23,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 399 [2018-12-02 12:39:23,121 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 642 states to 642 states and 1007 transitions. [2018-12-02 12:39:23,121 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 521 [2018-12-02 12:39:23,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 521 [2018-12-02 12:39:23,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 642 states and 1007 transitions. [2018-12-02 12:39:23,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,122 INFO L705 BuchiCegarLoop]: Abstraction has 642 states and 1007 transitions. [2018-12-02 12:39:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states and 1007 transitions. [2018-12-02 12:39:23,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 494. [2018-12-02 12:39:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-02 12:39:23,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 770 transitions. [2018-12-02 12:39:23,128 INFO L728 BuchiCegarLoop]: Abstraction has 494 states and 770 transitions. [2018-12-02 12:39:23,128 INFO L608 BuchiCegarLoop]: Abstraction has 494 states and 770 transitions. [2018-12-02 12:39:23,128 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 12:39:23,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 770 transitions. [2018-12-02 12:39:23,130 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2018-12-02 12:39:23,130 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,130 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,130 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] [2018-12-02 12:39:23,131 INFO L794 eck$LassoCheckResult]: Stem: 18970#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 18713#L-1 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;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;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; 18714#L116-2 assume !!(add_history_type_~var~0 < 3); 19067#L117 assume 0 == add_history_type_~history_id;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; 18914#L171 assume 0 == read_history_bool_~history_id; 18915#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18689#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 18889#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 18890#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 19101#L116-2 assume !(add_history_type_~var~0 < 3); 19098#L116-3 add_history_type_#res := 1; 18940#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 18941#L255 assume !(0 == init_~tmp~1);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; 19052#L116-6 assume !!(add_history_type_~var~0 < 3); 19047#L117-2 assume !(0 == add_history_type_~history_id); 19048#L123-2 assume 1 == add_history_type_~history_id;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; 19099#L171-4 assume !(0 == read_history_bool_~history_id); 18983#L181-4 assume 1 == read_history_bool_~history_id; 18984#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18869#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18759#L125-1 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18733#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 18933#L259 assume !(0 == init_~tmp___0~1);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; 18934#L116-10 assume !!(add_history_type_~var~0 < 3); 19041#L117-4 assume !(0 == add_history_type_~history_id); 19042#L123-4 assume 1 == add_history_type_~history_id;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; 19123#L171-7 assume !(0 == read_history_bool_~history_id); 19013#L181-7 assume 1 == read_history_bool_~history_id; 19014#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18811#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18754#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18726#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 18696#L263 assume !(0 == init_~tmp___1~1);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; 18697#L116-14 assume !!(add_history_type_~var~0 < 3); 19031#L117-6 assume !(0 == add_history_type_~history_id); 19033#L123-6 assume 1 == add_history_type_~history_id;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; 19114#L171-10 assume !(0 == read_history_bool_~history_id); 19001#L181-10 assume 1 == read_history_bool_~history_id; 19002#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 18790#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 18745#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 18718#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 18971#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 18936#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 18937#L558-2 [2018-12-02 12:39:23,131 INFO L796 eck$LassoCheckResult]: Loop: 18937#L558-2 assume !!(main_~i2~0 < 10);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;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; 18928#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 18929#L578-16 assume 0 != ~gate1Failed~0 % 256; 18922#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 18923#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; 18938#L409 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;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; 18912#L226-2 assume !(0 == write_history_bool_~history_id); 18913#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 18947#L578-17 assume 0 != ~gate2Failed~0 % 256; 19117#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 18793#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; 18765#L440 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;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; 18982#L226-4 assume !(0 == write_history_bool_~history_id); 18972#L231-4 assume !(1 == write_history_bool_~history_id); 18973#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 19121#L578-18 assume 0 != ~gate3Failed~0 % 256; 19063#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 19064#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; 19157#L471 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; 19154#L486 assume ~VALUE1~0 == ~VALUE2~0; 19143#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 18711#L578-19 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; 19125#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 19105#L578-20 ~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;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; 19144#L294 assume !(0 == ~gate1Failed~0 % 256); 18964#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 18965#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 19106#L171-12 assume 0 == read_history_bool_~history_id; 19054#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 18846#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 18722#L307 assume !(0 == check_~tmp___3~0 % 256); 18724#L307-1 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; 18730#L151-7 assume 3 == read_history_int8_~history_id; 18799#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18800#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 18806#L346 assume !(check_~tmp___10~0 > -2); 19019#L346-1 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; 19020#L151-9 assume 3 == read_history_int8_~history_id; 18786#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 18787#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 18794#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 18865#L366-1 check_#res := 1; 18855#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 18856#L583-72 assume !(0 == assert_~arg % 256); 19051#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 18937#L558-2 [2018-12-02 12:39:23,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1987741776, now seen corresponding path program 3 times [2018-12-02 12:39:23,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:23,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:23,158 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1550230682, now seen corresponding path program 1 times [2018-12-02 12:39:23,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,174 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:39:23,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:39:23,174 INFO L87 Difference]: Start difference. First operand 494 states and 770 transitions. cyclomatic complexity: 281 Second operand 4 states. [2018-12-02 12:39:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,201 INFO L93 Difference]: Finished difference Result 752 states and 1173 transitions. [2018-12-02 12:39:23,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:39:23,201 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 752 states and 1173 transitions. [2018-12-02 12:39:23,203 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 502 [2018-12-02 12:39:23,204 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 752 states to 717 states and 1120 transitions. [2018-12-02 12:39:23,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 596 [2018-12-02 12:39:23,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 596 [2018-12-02 12:39:23,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 717 states and 1120 transitions. [2018-12-02 12:39:23,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,205 INFO L705 BuchiCegarLoop]: Abstraction has 717 states and 1120 transitions. [2018-12-02 12:39:23,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states and 1120 transitions. [2018-12-02 12:39:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 461. [2018-12-02 12:39:23,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-12-02 12:39:23,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 718 transitions. [2018-12-02 12:39:23,210 INFO L728 BuchiCegarLoop]: Abstraction has 461 states and 718 transitions. [2018-12-02 12:39:23,210 INFO L608 BuchiCegarLoop]: Abstraction has 461 states and 718 transitions. [2018-12-02 12:39:23,210 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 12:39:23,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 461 states and 718 transitions. [2018-12-02 12:39:23,211 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2018-12-02 12:39:23,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,211 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,211 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] [2018-12-02 12:39:23,212 INFO L794 eck$LassoCheckResult]: Stem: 20204#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 19969#L-1 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;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;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; 19970#L116-2 assume !!(add_history_type_~var~0 < 3); 20290#L117 assume 0 == add_history_type_~history_id;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; 20152#L171 assume 0 == read_history_bool_~history_id; 20153#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 19945#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 20131#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 20132#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 20322#L116-2 assume !(add_history_type_~var~0 < 3); 20319#L116-3 add_history_type_#res := 1; 20175#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 20176#L255 assume !(0 == init_~tmp~1);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; 20277#L116-6 assume !!(add_history_type_~var~0 < 3); 20274#L117-2 assume !(0 == add_history_type_~history_id); 20275#L123-2 assume !(1 == add_history_type_~history_id); 20358#L129-2 assume !(2 == add_history_type_~history_id); 20348#L135-3 assume !(3 == add_history_type_~history_id); 19989#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 20339#L116-6 assume !(add_history_type_~var~0 < 3); 20336#L116-7 add_history_type_#res := 1; 20208#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 20169#L259 assume !(0 == init_~tmp___0~1);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; 20170#L116-10 assume !!(add_history_type_~var~0 < 3); 20268#L117-4 assume !(0 == add_history_type_~history_id); 20269#L123-4 assume 1 == add_history_type_~history_id;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; 20341#L171-7 assume !(0 == read_history_bool_~history_id); 20241#L181-7 assume 1 == read_history_bool_~history_id; 20242#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 20058#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 20002#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19983#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 19952#L263 assume !(0 == init_~tmp___1~1);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; 19953#L116-14 assume !!(add_history_type_~var~0 < 3); 20259#L117-6 assume !(0 == add_history_type_~history_id); 20261#L123-6 assume 1 == add_history_type_~history_id;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; 20333#L171-10 assume !(0 == read_history_bool_~history_id); 20229#L181-10 assume 1 == read_history_bool_~history_id; 20230#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 20038#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 19996#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 19977#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 20205#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 20172#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 20173#L558-2 [2018-12-02 12:39:23,212 INFO L796 eck$LassoCheckResult]: Loop: 20173#L558-2 assume !!(main_~i2~0 < 10);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;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; 20164#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 20165#L578-16 assume 0 != ~gate1Failed~0 % 256; 20159#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 20160#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; 20171#L409 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;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; 20150#L226-2 assume !(0 == write_history_bool_~history_id); 20151#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 20179#L578-17 assume 0 != ~gate2Failed~0 % 256; 20085#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 20033#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; 20012#L440 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;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; 20213#L226-4 assume !(0 == write_history_bool_~history_id); 20206#L231-4 assume !(1 == write_history_bool_~history_id); 20207#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 20220#L578-18 assume 0 != ~gate3Failed~0 % 256; 20285#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 20264#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; 20265#L471 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; 20282#L486 assume ~VALUE1~0 == ~VALUE2~0; 20284#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 19961#L578-19 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; 20340#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 20315#L578-20 ~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;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; 20316#L294 assume !(0 == ~gate1Failed~0 % 256); 20198#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 20199#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 20325#L171-12 assume 0 == read_history_bool_~history_id; 20279#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 20087#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 19973#L307 assume !(0 == check_~tmp___3~0 % 256); 19975#L307-1 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; 19981#L151-7 assume 3 == read_history_int8_~history_id; 20046#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 20047#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 20053#L346 assume !(check_~tmp___10~0 > -2); 20247#L346-1 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; 20248#L151-9 assume 3 == read_history_int8_~history_id; 20034#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 20035#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 20041#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 20109#L366-1 check_#res := 1; 20099#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 20100#L583-72 assume !(0 == assert_~arg % 256); 20276#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 20173#L558-2 [2018-12-02 12:39:23,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,212 INFO L82 PathProgramCache]: Analyzing trace with hash -2106629905, now seen corresponding path program 1 times [2018-12-02 12:39:23,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 12:39:23,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,228 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1550230682, now seen corresponding path program 2 times [2018-12-02 12:39:23,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,243 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,243 INFO L87 Difference]: Start difference. First operand 461 states and 718 transitions. cyclomatic complexity: 262 Second operand 3 states. [2018-12-02 12:39:23,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,271 INFO L93 Difference]: Finished difference Result 713 states and 1106 transitions. [2018-12-02 12:39:23,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 713 states and 1106 transitions. [2018-12-02 12:39:23,274 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 502 [2018-12-02 12:39:23,276 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 713 states to 713 states and 1106 transitions. [2018-12-02 12:39:23,277 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 604 [2018-12-02 12:39:23,277 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 604 [2018-12-02 12:39:23,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 713 states and 1106 transitions. [2018-12-02 12:39:23,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,277 INFO L705 BuchiCegarLoop]: Abstraction has 713 states and 1106 transitions. [2018-12-02 12:39:23,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states and 1106 transitions. [2018-12-02 12:39:23,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 451. [2018-12-02 12:39:23,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-12-02 12:39:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 698 transitions. [2018-12-02 12:39:23,284 INFO L728 BuchiCegarLoop]: Abstraction has 451 states and 698 transitions. [2018-12-02 12:39:23,284 INFO L608 BuchiCegarLoop]: Abstraction has 451 states and 698 transitions. [2018-12-02 12:39:23,284 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 12:39:23,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 451 states and 698 transitions. [2018-12-02 12:39:23,285 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 251 [2018-12-02 12:39:23,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,286 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] [2018-12-02 12:39:23,287 INFO L794 eck$LassoCheckResult]: Stem: 21374#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 21150#L-1 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;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;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; 21151#L116-2 assume !!(add_history_type_~var~0 < 3); 21461#L117 assume 0 == add_history_type_~history_id;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; 21325#L171 assume 0 == read_history_bool_~history_id; 21326#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21126#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 21308#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 21309#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21492#L116-2 assume !(add_history_type_~var~0 < 3); 21489#L116-3 add_history_type_#res := 1; 21346#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 21347#L255 assume !(0 == init_~tmp~1);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; 21448#L116-6 assume !!(add_history_type_~var~0 < 3); 21445#L117-2 assume !(0 == add_history_type_~history_id); 21446#L123-2 assume 1 == add_history_type_~history_id;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; 21490#L171-4 assume !(0 == read_history_bool_~history_id); 21382#L181-4 assume 1 == read_history_bool_~history_id; 21383#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21296#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21187#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 21188#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 21510#L116-6 assume !(add_history_type_~var~0 < 3); 21507#L116-7 add_history_type_#res := 1; 21378#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 21340#L259 assume !(0 == init_~tmp___0~1);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; 21341#L116-10 assume !!(add_history_type_~var~0 < 3); 21437#L117-4 assume !(0 == add_history_type_~history_id); 21438#L123-4 assume 1 == add_history_type_~history_id;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; 21512#L171-7 assume !(0 == read_history_bool_~history_id); 21408#L181-7 assume 1 == read_history_bool_~history_id; 21409#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21234#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21176#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21163#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 21133#L263 assume !(0 == init_~tmp___1~1);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; 21134#L116-14 assume !!(add_history_type_~var~0 < 3); 21426#L117-6 assume !(0 == add_history_type_~history_id); 21428#L123-6 assume 1 == add_history_type_~history_id;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; 21504#L171-10 assume !(0 == read_history_bool_~history_id); 21396#L181-10 assume 1 == read_history_bool_~history_id; 21397#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 21213#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 21172#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 21155#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 21375#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 21342#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 21343#L558-2 [2018-12-02 12:39:23,287 INFO L796 eck$LassoCheckResult]: Loop: 21343#L558-2 assume !!(main_~i2~0 < 10);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;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; 21336#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 21337#L578-16 assume 0 != ~gate1Failed~0 % 256; 21332#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 21333#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; 21344#L409 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;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; 21323#L226-2 assume !(0 == write_history_bool_~history_id); 21324#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 21349#L578-17 assume 0 != ~gate2Failed~0 % 256; 21262#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 21216#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; 21191#L440 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;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; 21381#L226-4 assume !(0 == write_history_bool_~history_id); 21376#L231-4 assume !(1 == write_history_bool_~history_id); 21377#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 21387#L578-18 assume 0 != ~gate3Failed~0 % 256; 21456#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 21433#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; 21434#L471 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; 21453#L486 assume ~VALUE1~0 == ~VALUE2~0; 21455#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 21148#L578-19 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; 21511#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 21486#L578-20 ~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;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; 21487#L294 assume !(0 == ~gate1Failed~0 % 256); 21368#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 21369#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 21495#L171-12 assume 0 == read_history_bool_~history_id; 21450#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 21264#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 21159#L307 assume !(0 == check_~tmp___3~0 % 256); 21161#L307-1 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; 21167#L151-7 assume 3 == read_history_int8_~history_id; 21229#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21230#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 21232#L346 assume !(check_~tmp___10~0 > -2); 21414#L346-1 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; 21415#L151-9 assume 3 == read_history_int8_~history_id; 21217#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 21218#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 21220#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 21286#L366-1 check_#res := 1; 21276#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 21277#L583-72 assume !(0 == assert_~arg % 256); 21447#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 21343#L558-2 [2018-12-02 12:39:23,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,287 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 1 times [2018-12-02 12:39:23,287 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,287 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,288 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,313 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1550230682, now seen corresponding path program 3 times [2018-12-02 12:39:23,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,338 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,338 INFO L87 Difference]: Start difference. First operand 451 states and 698 transitions. cyclomatic complexity: 254 Second operand 3 states. [2018-12-02 12:39:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,354 INFO L93 Difference]: Finished difference Result 675 states and 1052 transitions. [2018-12-02 12:39:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,354 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 675 states and 1052 transitions. [2018-12-02 12:39:23,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 475 [2018-12-02 12:39:23,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 675 states to 675 states and 1052 transitions. [2018-12-02 12:39:23,358 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 566 [2018-12-02 12:39:23,358 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 566 [2018-12-02 12:39:23,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 675 states and 1052 transitions. [2018-12-02 12:39:23,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,359 INFO L705 BuchiCegarLoop]: Abstraction has 675 states and 1052 transitions. [2018-12-02 12:39:23,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states and 1052 transitions. [2018-12-02 12:39:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 512. [2018-12-02 12:39:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2018-12-02 12:39:23,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 792 transitions. [2018-12-02 12:39:23,364 INFO L728 BuchiCegarLoop]: Abstraction has 512 states and 792 transitions. [2018-12-02 12:39:23,364 INFO L608 BuchiCegarLoop]: Abstraction has 512 states and 792 transitions. [2018-12-02 12:39:23,364 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 12:39:23,364 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 512 states and 792 transitions. [2018-12-02 12:39:23,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 312 [2018-12-02 12:39:23,365 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,365 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,365 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,365 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-12-02 12:39:23,366 INFO L794 eck$LassoCheckResult]: Stem: 22509#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 22283#L-1 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;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;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; 22284#L116-2 assume !!(add_history_type_~var~0 < 3); 22596#L117 assume 0 == add_history_type_~history_id;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; 22460#L171 assume 0 == read_history_bool_~history_id; 22461#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22256#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 22443#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 22444#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22626#L116-2 assume !(add_history_type_~var~0 < 3); 22624#L116-3 add_history_type_#res := 1; 22480#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 22481#L255 assume !(0 == init_~tmp~1);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; 22583#L116-6 assume !!(add_history_type_~var~0 < 3); 22580#L117-2 assume !(0 == add_history_type_~history_id); 22581#L123-2 assume 1 == add_history_type_~history_id;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; 22625#L171-4 assume !(0 == read_history_bool_~history_id); 22517#L181-4 assume 1 == read_history_bool_~history_id; 22518#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22423#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22318#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 22319#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 22645#L116-6 assume !(add_history_type_~var~0 < 3); 22642#L116-7 add_history_type_#res := 1; 22513#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 22474#L259 assume !(0 == init_~tmp___0~1);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; 22475#L116-10 assume !!(add_history_type_~var~0 < 3); 22572#L117-4 assume !(0 == add_history_type_~history_id); 22573#L123-4 assume 1 == add_history_type_~history_id;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; 22646#L171-7 assume !(0 == read_history_bool_~history_id); 22543#L181-7 assume 1 == read_history_bool_~history_id; 22544#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22368#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22312#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22296#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 22266#L263 assume !(0 == init_~tmp___1~1);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; 22267#L116-14 assume !!(add_history_type_~var~0 < 3); 22561#L117-6 assume !(0 == add_history_type_~history_id); 22563#L123-6 assume 1 == add_history_type_~history_id;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; 22638#L171-10 assume !(0 == read_history_bool_~history_id); 22531#L181-10 assume 1 == read_history_bool_~history_id; 22532#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 22346#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 22305#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 22288#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 22510#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 22477#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 22478#L558-2 [2018-12-02 12:39:23,366 INFO L796 eck$LassoCheckResult]: Loop: 22478#L558-2 assume !!(main_~i2~0 < 10);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;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; 22471#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 22472#L578-16 assume 0 != ~gate1Failed~0 % 256; 22467#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 22468#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; 22479#L409 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;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; 22458#L226-2 assume !(0 == write_history_bool_~history_id); 22459#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 22718#L578-17 assume 0 != ~gate2Failed~0 % 256; 22396#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 22349#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; 22350#L440 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;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; 22731#L226-4 assume !(0 == write_history_bool_~history_id); 22729#L231-4 assume !(1 == write_history_bool_~history_id); 22728#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 22725#L578-18 assume 0 != ~gate3Failed~0 % 256; 22721#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 22717#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; 22715#L471 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; 22693#L486 assume ~VALUE1~0 == ~VALUE2~0; 22679#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 22677#L578-19 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; 22674#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 22671#L578-20 ~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;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; 22669#L294 assume !(0 == ~gate1Failed~0 % 256); 22504#L297 assume !(0 == ~gate2Failed~0 % 256); 22505#L300 assume 0 == ~gate3Failed~0 % 256;check_~tmp~2 := 1; 22661#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 22630#L171-12 assume 0 == read_history_bool_~history_id; 22585#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 22398#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 22292#L307 assume !(0 == check_~tmp___3~0 % 256); 22294#L307-1 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; 22300#L151-7 assume 3 == read_history_int8_~history_id; 22363#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22364#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 22366#L346 assume !(check_~tmp___10~0 > -2); 22549#L346-1 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; 22550#L151-9 assume 3 == read_history_int8_~history_id; 22351#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 22352#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 22354#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 22421#L366-1 check_#res := 1; 22410#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 22411#L583-72 assume !(0 == assert_~arg % 256); 22582#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 22478#L558-2 [2018-12-02 12:39:23,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,366 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 2 times [2018-12-02 12:39:23,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,385 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1179825932, now seen corresponding path program 1 times [2018-12-02 12:39:23,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,405 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,405 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,405 INFO L87 Difference]: Start difference. First operand 512 states and 792 transitions. cyclomatic complexity: 287 Second operand 3 states. [2018-12-02 12:39:23,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,432 INFO L93 Difference]: Finished difference Result 772 states and 1206 transitions. [2018-12-02 12:39:23,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 1206 transitions. [2018-12-02 12:39:23,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 572 [2018-12-02 12:39:23,438 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 772 states and 1206 transitions. [2018-12-02 12:39:23,438 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 663 [2018-12-02 12:39:23,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 663 [2018-12-02 12:39:23,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 772 states and 1206 transitions. [2018-12-02 12:39:23,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,439 INFO L705 BuchiCegarLoop]: Abstraction has 772 states and 1206 transitions. [2018-12-02 12:39:23,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states and 1206 transitions. [2018-12-02 12:39:23,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 579. [2018-12-02 12:39:23,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-02 12:39:23,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 902 transitions. [2018-12-02 12:39:23,447 INFO L728 BuchiCegarLoop]: Abstraction has 579 states and 902 transitions. [2018-12-02 12:39:23,447 INFO L608 BuchiCegarLoop]: Abstraction has 579 states and 902 transitions. [2018-12-02 12:39:23,447 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 12:39:23,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 579 states and 902 transitions. [2018-12-02 12:39:23,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 379 [2018-12-02 12:39:23,448 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,448 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,449 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,449 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-12-02 12:39:23,449 INFO L794 eck$LassoCheckResult]: Stem: 23798#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 23574#L-1 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;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;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; 23575#L116-2 assume !!(add_history_type_~var~0 < 3); 23887#L117 assume 0 == add_history_type_~history_id;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; 23750#L171 assume 0 == read_history_bool_~history_id; 23751#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23547#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 23733#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 23734#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 23918#L116-2 assume !(add_history_type_~var~0 < 3); 23916#L116-3 add_history_type_#res := 1; 23770#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 23771#L255 assume !(0 == init_~tmp~1);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; 23873#L116-6 assume !!(add_history_type_~var~0 < 3); 23870#L117-2 assume !(0 == add_history_type_~history_id); 23871#L123-2 assume 1 == add_history_type_~history_id;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; 23917#L171-4 assume !(0 == read_history_bool_~history_id); 23807#L181-4 assume 1 == read_history_bool_~history_id; 23808#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23713#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23609#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 23610#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 23937#L116-6 assume !(add_history_type_~var~0 < 3); 23934#L116-7 add_history_type_#res := 1; 23802#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 23764#L259 assume !(0 == init_~tmp___0~1);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; 23765#L116-10 assume !!(add_history_type_~var~0 < 3); 23862#L117-4 assume !(0 == add_history_type_~history_id); 23863#L123-4 assume 1 == add_history_type_~history_id;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; 23938#L171-7 assume !(0 == read_history_bool_~history_id); 23833#L181-7 assume 1 == read_history_bool_~history_id; 23834#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23659#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23603#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23587#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 23557#L263 assume !(0 == init_~tmp___1~1);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; 23558#L116-14 assume !!(add_history_type_~var~0 < 3); 23851#L117-6 assume !(0 == add_history_type_~history_id); 23853#L123-6 assume 1 == add_history_type_~history_id;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; 23931#L171-10 assume !(0 == read_history_bool_~history_id); 23821#L181-10 assume 1 == read_history_bool_~history_id; 23822#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 23637#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 23596#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 23579#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 23799#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 23767#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 23768#L558-2 [2018-12-02 12:39:23,450 INFO L796 eck$LassoCheckResult]: Loop: 23768#L558-2 assume !!(main_~i2~0 < 10);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;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; 23761#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 23762#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 23810#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 23756#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 23766#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; 23915#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; 23920#L409 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;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; 24080#L226-2 assume !(0 == write_history_bool_~history_id); 24078#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 24075#L578-17 assume 0 != ~gate2Failed~0 % 256; 24059#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 24057#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; 24054#L440 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;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; 24052#L226-4 assume !(0 == write_history_bool_~history_id); 24051#L231-4 assume !(1 == write_history_bool_~history_id); 24050#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 24047#L578-18 assume 0 != ~gate3Failed~0 % 256; 24048#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 24115#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; 24114#L471 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; 24113#L486 assume ~VALUE1~0 == ~VALUE2~0; 24081#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 24074#L578-19 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; 24073#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 24070#L578-20 ~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;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; 24071#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 23955#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 23923#L171-12 assume 0 == read_history_bool_~history_id; 23875#L172-12 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 23689#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 23583#L307 assume !(0 == check_~tmp___3~0 % 256); 23585#L307-1 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; 23591#L151-7 assume 3 == read_history_int8_~history_id; 23654#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23655#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 23657#L346 assume !(check_~tmp___10~0 > -2); 23839#L346-1 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; 23840#L151-9 assume 3 == read_history_int8_~history_id; 23642#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 23643#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 23645#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 23711#L366-1 check_#res := 1; 23701#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 23702#L583-72 assume !(0 == assert_~arg % 256); 23872#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 23768#L558-2 [2018-12-02 12:39:23,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 3 times [2018-12-02 12:39:23,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,468 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1542817568, now seen corresponding path program 1 times [2018-12-02 12:39:23,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,492 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,492 INFO L87 Difference]: Start difference. First operand 579 states and 902 transitions. cyclomatic complexity: 330 Second operand 3 states. [2018-12-02 12:39:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,570 INFO L93 Difference]: Finished difference Result 917 states and 1383 transitions. [2018-12-02 12:39:23,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 917 states and 1383 transitions. [2018-12-02 12:39:23,572 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 379 [2018-12-02 12:39:23,574 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 917 states to 917 states and 1383 transitions. [2018-12-02 12:39:23,575 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 755 [2018-12-02 12:39:23,575 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 755 [2018-12-02 12:39:23,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 917 states and 1383 transitions. [2018-12-02 12:39:23,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,576 INFO L705 BuchiCegarLoop]: Abstraction has 917 states and 1383 transitions. [2018-12-02 12:39:23,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states and 1383 transitions. [2018-12-02 12:39:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 579. [2018-12-02 12:39:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-02 12:39:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 874 transitions. [2018-12-02 12:39:23,581 INFO L728 BuchiCegarLoop]: Abstraction has 579 states and 874 transitions. [2018-12-02 12:39:23,581 INFO L608 BuchiCegarLoop]: Abstraction has 579 states and 874 transitions. [2018-12-02 12:39:23,581 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 12:39:23,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 579 states and 874 transitions. [2018-12-02 12:39:23,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 379 [2018-12-02 12:39:23,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,583 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,583 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] [2018-12-02 12:39:23,583 INFO L794 eck$LassoCheckResult]: Stem: 25301#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 25077#L-1 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;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;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; 25078#L116-2 assume !!(add_history_type_~var~0 < 3); 25386#L117 assume 0 == add_history_type_~history_id;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; 25253#L171 assume 0 == read_history_bool_~history_id; 25254#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 25053#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 25236#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 25237#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 25417#L116-2 assume !(add_history_type_~var~0 < 3); 25414#L116-3 add_history_type_#res := 1; 25274#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 25275#L255 assume !(0 == init_~tmp~1);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; 25373#L116-6 assume !!(add_history_type_~var~0 < 3); 25370#L117-2 assume !(0 == add_history_type_~history_id); 25371#L123-2 assume 1 == add_history_type_~history_id;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; 25415#L171-4 assume !(0 == read_history_bool_~history_id); 25309#L181-4 assume 1 == read_history_bool_~history_id; 25310#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25218#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25112#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 25113#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 25434#L116-6 assume !(add_history_type_~var~0 < 3); 25431#L116-7 add_history_type_#res := 1; 25305#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 25267#L259 assume !(0 == init_~tmp___0~1);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; 25268#L116-10 assume !!(add_history_type_~var~0 < 3); 25364#L117-4 assume !(0 == add_history_type_~history_id); 25365#L123-4 assume 1 == add_history_type_~history_id;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; 25436#L171-7 assume !(0 == read_history_bool_~history_id); 25335#L181-7 assume 1 == read_history_bool_~history_id; 25336#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25165#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25106#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25091#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 25060#L263 assume !(0 == init_~tmp___1~1);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; 25061#L116-14 assume !!(add_history_type_~var~0 < 3); 25353#L117-6 assume !(0 == add_history_type_~history_id); 25355#L123-6 assume 1 == add_history_type_~history_id;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; 25428#L171-10 assume !(0 == read_history_bool_~history_id); 25323#L181-10 assume 1 == read_history_bool_~history_id; 25324#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 25143#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 25099#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 25085#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 25302#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 25270#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 25271#L558-2 [2018-12-02 12:39:23,583 INFO L796 eck$LassoCheckResult]: Loop: 25271#L558-2 assume !!(main_~i2~0 < 10);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;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; 25264#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 25265#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 25312#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 25259#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 25269#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; 25413#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; 25418#L409 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;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; 25532#L226-2 assume !(0 == write_history_bool_~history_id); 25530#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 25528#L578-17 assume 0 != ~gate2Failed~0 % 256; 25524#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 25522#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; 25520#L440 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;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; 25518#L226-4 assume !(0 == write_history_bool_~history_id); 25516#L231-4 assume !(1 == write_history_bool_~history_id); 25514#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 25510#L578-18 assume 0 != ~gate3Failed~0 % 256; 25511#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 25623#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; 25622#L471 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; 25621#L486 assume ~VALUE1~0 == ~VALUE2~0; 25612#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 25611#L578-19 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; 25610#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 25608#L578-20 ~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;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; 25456#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 25450#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 25420#L171-12 assume 0 == read_history_bool_~history_id; 25375#L172-12 assume !(0 == read_history_bool_~historyIndex); 25350#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 25191#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 25081#L307 assume !(0 == check_~tmp___3~0 % 256); 25083#L307-1 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; 25089#L151-7 assume 3 == read_history_int8_~history_id; 25153#L152-7 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25154#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 25160#L346 assume !(check_~tmp___10~0 > -2); 25341#L346-1 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; 25342#L151-9 assume 3 == read_history_int8_~history_id; 25139#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 25140#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 25148#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 25214#L366-1 check_#res := 1; 25204#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 25205#L583-72 assume !(0 == assert_~arg % 256); 25372#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 25271#L558-2 [2018-12-02 12:39:23,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,583 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 4 times [2018-12-02 12:39:23,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,600 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,600 INFO L82 PathProgramCache]: Analyzing trace with hash 534720279, now seen corresponding path program 1 times [2018-12-02 12:39:23,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:23,619 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:39:23,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:39:23,620 INFO L87 Difference]: Start difference. First operand 579 states and 874 transitions. cyclomatic complexity: 302 Second operand 4 states. [2018-12-02 12:39:23,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,778 INFO L93 Difference]: Finished difference Result 1684 states and 2542 transitions. [2018-12-02 12:39:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:39:23,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1684 states and 2542 transitions. [2018-12-02 12:39:23,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 711 [2018-12-02 12:39:23,789 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1684 states to 1684 states and 2542 transitions. [2018-12-02 12:39:23,789 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1422 [2018-12-02 12:39:23,789 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1422 [2018-12-02 12:39:23,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1684 states and 2542 transitions. [2018-12-02 12:39:23,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,790 INFO L705 BuchiCegarLoop]: Abstraction has 1684 states and 2542 transitions. [2018-12-02 12:39:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states and 2542 transitions. [2018-12-02 12:39:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 579. [2018-12-02 12:39:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-12-02 12:39:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 873 transitions. [2018-12-02 12:39:23,797 INFO L728 BuchiCegarLoop]: Abstraction has 579 states and 873 transitions. [2018-12-02 12:39:23,797 INFO L608 BuchiCegarLoop]: Abstraction has 579 states and 873 transitions. [2018-12-02 12:39:23,797 INFO L442 BuchiCegarLoop]: ======== Iteration 16============ [2018-12-02 12:39:23,797 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 579 states and 873 transitions. [2018-12-02 12:39:23,798 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 379 [2018-12-02 12:39:23,798 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,798 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,798 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,798 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-12-02 12:39:23,799 INFO L794 eck$LassoCheckResult]: Stem: 27575#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 27351#L-1 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;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;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; 27352#L116-2 assume !!(add_history_type_~var~0 < 3); 27665#L117 assume 0 == add_history_type_~history_id;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; 27527#L171 assume 0 == read_history_bool_~history_id; 27528#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 27324#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 27510#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 27511#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 27696#L116-2 assume !(add_history_type_~var~0 < 3); 27694#L116-3 add_history_type_#res := 1; 27547#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 27548#L255 assume !(0 == init_~tmp~1);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; 27650#L116-6 assume !!(add_history_type_~var~0 < 3); 27647#L117-2 assume !(0 == add_history_type_~history_id); 27648#L123-2 assume 1 == add_history_type_~history_id;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; 27695#L171-4 assume !(0 == read_history_bool_~history_id); 27583#L181-4 assume 1 == read_history_bool_~history_id; 27584#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27490#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27386#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 27387#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 27716#L116-6 assume !(add_history_type_~var~0 < 3); 27712#L116-7 add_history_type_#res := 1; 27579#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 27541#L259 assume !(0 == init_~tmp___0~1);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; 27542#L116-10 assume !!(add_history_type_~var~0 < 3); 27639#L117-4 assume !(0 == add_history_type_~history_id); 27640#L123-4 assume 1 == add_history_type_~history_id;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; 27717#L171-7 assume !(0 == read_history_bool_~history_id); 27609#L181-7 assume 1 == read_history_bool_~history_id; 27610#L182-7 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27436#L203-7 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27380#L125-2 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27364#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 27334#L263 assume !(0 == init_~tmp___1~1);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; 27335#L116-14 assume !!(add_history_type_~var~0 < 3); 27627#L117-6 assume !(0 == add_history_type_~history_id); 27629#L123-6 assume 1 == add_history_type_~history_id;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; 27709#L171-10 assume !(0 == read_history_bool_~history_id); 27597#L181-10 assume 1 == read_history_bool_~history_id; 27598#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 27414#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 27373#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 27356#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 27576#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 27544#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 27545#L558-2 [2018-12-02 12:39:23,799 INFO L796 eck$LassoCheckResult]: Loop: 27545#L558-2 assume !!(main_~i2~0 < 10);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;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; 27538#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 27539#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 27586#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 27533#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 27543#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; 27693#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; 27633#L409 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;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; 27525#L226-2 assume !(0 == write_history_bool_~history_id); 27526#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 27551#L578-17 assume 0 != ~gate2Failed~0 % 256; 27464#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 27417#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; 27418#L440 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;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; 27859#L226-4 assume !(0 == write_history_bool_~history_id); 27858#L231-4 assume !(1 == write_history_bool_~history_id); 27855#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 27852#L578-18 assume 0 != ~gate3Failed~0 % 256; 27659#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 27660#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; 27873#L471 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; 27872#L486 assume ~VALUE1~0 == ~VALUE2~0; 27863#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 27862#L578-19 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; 27861#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 27691#L578-20 ~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;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; 27692#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 27733#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 27700#L171-12 assume 0 == read_history_bool_~history_id; 27652#L172-12 assume !(0 == read_history_bool_~historyIndex); 27624#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 27466#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 27360#L307 assume !(0 == check_~tmp___3~0 % 256); 27362#L307-1 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; 27368#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 27670#L583-54 assume !(0 == assert_~arg % 256); 27671#L578-27 read_history_int8_#res := -2; 27433#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 27434#L346 assume !(check_~tmp___10~0 > -2); 27615#L346-1 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; 27616#L151-9 assume 3 == read_history_int8_~history_id; 27419#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 27420#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 27422#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 27488#L366-1 check_#res := 1; 27478#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 27479#L583-72 assume !(0 == assert_~arg % 256); 27649#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 27545#L558-2 [2018-12-02 12:39:23,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,799 INFO L82 PathProgramCache]: Analyzing trace with hash 930141879, now seen corresponding path program 5 times [2018-12-02 12:39:23,799 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,799 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,813 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2094784061, now seen corresponding path program 1 times [2018-12-02 12:39:23,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,836 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,837 INFO L87 Difference]: Start difference. First operand 579 states and 873 transitions. cyclomatic complexity: 301 Second operand 3 states. [2018-12-02 12:39:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,863 INFO L93 Difference]: Finished difference Result 928 states and 1389 transitions. [2018-12-02 12:39:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 928 states and 1389 transitions. [2018-12-02 12:39:23,866 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 758 [2018-12-02 12:39:23,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 928 states to 928 states and 1389 transitions. [2018-12-02 12:39:23,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 837 [2018-12-02 12:39:23,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 837 [2018-12-02 12:39:23,870 INFO L73 IsDeterministic]: Start isDeterministic. Operand 928 states and 1389 transitions. [2018-12-02 12:39:23,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,871 INFO L705 BuchiCegarLoop]: Abstraction has 928 states and 1389 transitions. [2018-12-02 12:39:23,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states and 1389 transitions. [2018-12-02 12:39:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 543. [2018-12-02 12:39:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-12-02 12:39:23,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 811 transitions. [2018-12-02 12:39:23,878 INFO L728 BuchiCegarLoop]: Abstraction has 543 states and 811 transitions. [2018-12-02 12:39:23,878 INFO L608 BuchiCegarLoop]: Abstraction has 543 states and 811 transitions. [2018-12-02 12:39:23,878 INFO L442 BuchiCegarLoop]: ======== Iteration 17============ [2018-12-02 12:39:23,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 543 states and 811 transitions. [2018-12-02 12:39:23,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 379 [2018-12-02 12:39:23,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,880 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,880 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-12-02 12:39:23,881 INFO L794 eck$LassoCheckResult]: Stem: 29063#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 28865#L-1 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;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;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; 28866#L116-2 assume !!(add_history_type_~var~0 < 3); 29143#L117 assume 0 == add_history_type_~history_id;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; 29017#L171 assume 0 == read_history_bool_~history_id; 29018#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 28841#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 29004#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 29005#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 29174#L116-2 assume !(add_history_type_~var~0 < 3); 29172#L116-3 add_history_type_#res := 1; 29036#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 29037#L255 assume !(0 == init_~tmp~1);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; 29129#L116-6 assume !!(add_history_type_~var~0 < 3); 29126#L117-2 assume !(0 == add_history_type_~history_id); 29127#L123-2 assume 1 == add_history_type_~history_id;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; 29173#L171-4 assume !(0 == read_history_bool_~history_id); 29071#L181-4 assume 1 == read_history_bool_~history_id; 29072#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 28994#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28897#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 28898#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 29197#L116-6 assume !(add_history_type_~var~0 < 3); 29192#L116-7 add_history_type_#res := 1; 29067#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 29029#L259 assume !(0 == init_~tmp___0~1);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; 29030#L116-10 assume !!(add_history_type_~var~0 < 3); 29120#L117-4 assume !(0 == add_history_type_~history_id); 29121#L123-4 assume !(1 == add_history_type_~history_id); 29206#L129-4 assume 2 == add_history_type_~history_id;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; 29193#L171-8 assume !(0 == read_history_bool_~history_id); 29091#L181-8 assume 1 == read_history_bool_~history_id; 29092#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 28933#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 28877#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 28878#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 28848#L263 assume !(0 == init_~tmp___1~1);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; 28849#L116-14 assume !!(add_history_type_~var~0 < 3); 29109#L117-6 assume !(0 == add_history_type_~history_id); 29111#L123-6 assume 1 == add_history_type_~history_id;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; 29188#L171-10 assume !(0 == read_history_bool_~history_id); 29085#L181-10 assume 1 == read_history_bool_~history_id; 29086#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 28919#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 28887#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 28870#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 29064#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 29032#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 29033#L558-2 [2018-12-02 12:39:23,881 INFO L796 eck$LassoCheckResult]: Loop: 29033#L558-2 assume !!(main_~i2~0 < 10);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;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; 29026#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 29027#L578-16 assume 0 != ~gate1Failed~0 % 256; 29024#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 29025#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; 29034#L409 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;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; 29015#L226-2 assume !(0 == write_history_bool_~history_id); 29016#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 29041#L578-17 assume 0 != ~gate2Failed~0 % 256; 29191#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 29334#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; 29333#L440 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;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; 29332#L226-4 assume !(0 == write_history_bool_~history_id); 29331#L231-4 assume !(1 == write_history_bool_~history_id); 29330#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 29328#L578-18 assume 0 != ~gate3Failed~0 % 256; 29140#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 29118#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; 29119#L471 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; 29135#L486 assume ~VALUE1~0 == ~VALUE2~0; 29137#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 28863#L578-19 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; 29198#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 29178#L578-20 ~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;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; 29209#L294 assume !(0 == ~gate1Failed~0 % 256); 29058#L297 assume !(0 == ~gate2Failed~0 % 256); 29059#L300 assume !(0 == ~gate3Failed~0 % 256);check_~tmp~2 := 0; 29208#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 29179#L171-12 assume 0 == read_history_bool_~history_id; 29131#L172-12 assume !(0 == read_history_bool_~historyIndex); 29107#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 28970#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 28874#L307 assume !(0 == check_~tmp___3~0 % 256); 28876#L307-1 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; 28882#L151-7 assume 3 == read_history_int8_~history_id; 28936#L152-7 assume !(0 == read_history_int8_~historyIndex); 28937#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 28938#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 28939#L346 assume !(check_~tmp___10~0 > -2); 29097#L346-1 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; 29098#L151-9 assume 3 == read_history_int8_~history_id; 28924#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 28925#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 28927#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 28990#L366-1 check_#res := 1; 28980#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 28981#L583-72 assume !(0 == assert_~arg % 256); 29128#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 29033#L558-2 [2018-12-02 12:39:23,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,881 INFO L82 PathProgramCache]: Analyzing trace with hash 237363222, now seen corresponding path program 1 times [2018-12-02 12:39:23,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:23,902 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1026982464, now seen corresponding path program 1 times [2018-12-02 12:39:23,902 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,919 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,919 INFO L87 Difference]: Start difference. First operand 543 states and 811 transitions. cyclomatic complexity: 275 Second operand 3 states. [2018-12-02 12:39:23,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:23,925 INFO L93 Difference]: Finished difference Result 544 states and 811 transitions. [2018-12-02 12:39:23,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:23,925 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 544 states and 811 transitions. [2018-12-02 12:39:23,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2018-12-02 12:39:23,927 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 544 states to 523 states and 777 transitions. [2018-12-02 12:39:23,927 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2018-12-02 12:39:23,927 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2018-12-02 12:39:23,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 523 states and 777 transitions. [2018-12-02 12:39:23,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:23,928 INFO L705 BuchiCegarLoop]: Abstraction has 523 states and 777 transitions. [2018-12-02 12:39:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states and 777 transitions. [2018-12-02 12:39:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2018-12-02 12:39:23,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-12-02 12:39:23,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 777 transitions. [2018-12-02 12:39:23,931 INFO L728 BuchiCegarLoop]: Abstraction has 523 states and 777 transitions. [2018-12-02 12:39:23,932 INFO L608 BuchiCegarLoop]: Abstraction has 523 states and 777 transitions. [2018-12-02 12:39:23,932 INFO L442 BuchiCegarLoop]: ======== Iteration 18============ [2018-12-02 12:39:23,932 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 523 states and 777 transitions. [2018-12-02 12:39:23,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 359 [2018-12-02 12:39:23,932 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:23,932 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:23,933 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:23,933 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-12-02 12:39:23,933 INFO L794 eck$LassoCheckResult]: Stem: 30158#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 29960#L-1 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;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;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; 29961#L116-2 assume !!(add_history_type_~var~0 < 3); 30237#L117 assume 0 == add_history_type_~history_id;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; 30112#L171 assume 0 == read_history_bool_~history_id; 30113#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 29936#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 30099#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 30100#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 30268#L116-2 assume !(add_history_type_~var~0 < 3); 30265#L116-3 add_history_type_#res := 1; 30131#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 30132#L255 assume !(0 == init_~tmp~1);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; 30224#L116-6 assume !!(add_history_type_~var~0 < 3); 30221#L117-2 assume !(0 == add_history_type_~history_id); 30222#L123-2 assume 1 == add_history_type_~history_id;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; 30266#L171-4 assume !(0 == read_history_bool_~history_id); 30166#L181-4 assume 1 == read_history_bool_~history_id; 30167#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 30089#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29992#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 29993#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 30286#L116-6 assume !(add_history_type_~var~0 < 3); 30283#L116-7 add_history_type_#res := 1; 30162#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 30124#L259 assume !(0 == init_~tmp___0~1);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; 30125#L116-10 assume !!(add_history_type_~var~0 < 3); 30215#L117-4 assume !(0 == add_history_type_~history_id); 30216#L123-4 assume !(1 == add_history_type_~history_id); 30294#L129-4 assume 2 == add_history_type_~history_id;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; 30284#L171-8 assume !(0 == read_history_bool_~history_id); 30186#L181-8 assume 1 == read_history_bool_~history_id; 30187#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 30030#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 29973#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29974#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 29943#L263 assume !(0 == init_~tmp___1~1);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; 29944#L116-14 assume !!(add_history_type_~var~0 < 3); 30204#L117-6 assume !(0 == add_history_type_~history_id); 30206#L123-6 assume 1 == add_history_type_~history_id;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; 30280#L171-10 assume !(0 == read_history_bool_~history_id); 30180#L181-10 assume 1 == read_history_bool_~history_id; 30181#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 30017#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 29982#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 29968#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 30159#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 30127#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 30128#L558-2 [2018-12-02 12:39:23,933 INFO L796 eck$LassoCheckResult]: Loop: 30128#L558-2 assume !!(main_~i2~0 < 10);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;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; 30121#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 30122#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 30169#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 30118#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 30126#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; 30264#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; 30269#L409 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;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; 30370#L226-2 assume !(0 == write_history_bool_~history_id); 30368#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 30365#L578-17 assume 0 != ~gate2Failed~0 % 256; 30366#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 30414#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; 30413#L440 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;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; 30412#L226-4 assume !(0 == write_history_bool_~history_id); 30411#L231-4 assume !(1 == write_history_bool_~history_id); 30410#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 30408#L578-18 assume 0 != ~gate3Failed~0 % 256; 30234#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 30213#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; 30214#L471 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; 30229#L486 assume ~VALUE1~0 == ~VALUE2~0; 30231#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 29952#L578-19 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; 30287#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 30271#L578-20 ~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;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; 30300#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 30154#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 30272#L171-12 assume 0 == read_history_bool_~history_id; 30226#L172-12 assume !(0 == read_history_bool_~historyIndex); 30201#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 30061#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 29964#L307 assume !(0 == check_~tmp___3~0 % 256); 29966#L307-1 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; 29972#L151-7 assume !(3 == read_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 30242#L583-54 assume !(0 == assert_~arg % 256); 30243#L578-27 read_history_int8_#res := -2; 30033#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 30034#L346 assume !(check_~tmp___10~0 > -2); 30192#L346-1 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; 30193#L151-9 assume 3 == read_history_int8_~history_id; 30013#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 30014#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 30022#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 30085#L366-1 check_#res := 1; 30074#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 30075#L583-72 assume !(0 == assert_~arg % 256); 30223#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 30128#L558-2 [2018-12-02 12:39:23,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,933 INFO L82 PathProgramCache]: Analyzing trace with hash 237363222, now seen corresponding path program 2 times [2018-12-02 12:39:23,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:23,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:23,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:23,959 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:23,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:23,959 INFO L82 PathProgramCache]: Analyzing trace with hash -2094784061, now seen corresponding path program 2 times [2018-12-02 12:39:23,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:23,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:23,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:23,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:23,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:23,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:23,975 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:39:23,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:39:23,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:39:23,976 INFO L87 Difference]: Start difference. First operand 523 states and 777 transitions. cyclomatic complexity: 261 Second operand 3 states. [2018-12-02 12:39:24,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:24,001 INFO L93 Difference]: Finished difference Result 821 states and 1228 transitions. [2018-12-02 12:39:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:39:24,001 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 821 states and 1228 transitions. [2018-12-02 12:39:24,004 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 341 [2018-12-02 12:39:24,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 821 states to 821 states and 1228 transitions. [2018-12-02 12:39:24,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 695 [2018-12-02 12:39:24,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 695 [2018-12-02 12:39:24,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 821 states and 1228 transitions. [2018-12-02 12:39:24,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:24,007 INFO L705 BuchiCegarLoop]: Abstraction has 821 states and 1228 transitions. [2018-12-02 12:39:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states and 1228 transitions. [2018-12-02 12:39:24,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 501. [2018-12-02 12:39:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-12-02 12:39:24,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 744 transitions. [2018-12-02 12:39:24,014 INFO L728 BuchiCegarLoop]: Abstraction has 501 states and 744 transitions. [2018-12-02 12:39:24,014 INFO L608 BuchiCegarLoop]: Abstraction has 501 states and 744 transitions. [2018-12-02 12:39:24,014 INFO L442 BuchiCegarLoop]: ======== Iteration 19============ [2018-12-02 12:39:24,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 501 states and 744 transitions. [2018-12-02 12:39:24,015 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 341 [2018-12-02 12:39:24,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:24,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:24,016 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:24,016 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-12-02 12:39:24,016 INFO L794 eck$LassoCheckResult]: Stem: 31510#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 31312#L-1 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;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;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; 31313#L116-2 assume !!(add_history_type_~var~0 < 3); 31581#L117 assume 0 == add_history_type_~history_id;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; 31464#L171 assume 0 == read_history_bool_~history_id; 31465#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 31288#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 31451#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 31452#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 31602#L116-2 assume !(add_history_type_~var~0 < 3); 31599#L116-3 add_history_type_#res := 1; 31483#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 31484#L255 assume !(0 == init_~tmp~1);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; 31572#L116-6 assume !!(add_history_type_~var~0 < 3); 31569#L117-2 assume !(0 == add_history_type_~history_id); 31570#L123-2 assume 1 == add_history_type_~history_id;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; 31600#L171-4 assume !(0 == read_history_bool_~history_id); 31518#L181-4 assume 1 == read_history_bool_~history_id; 31519#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 31441#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 31346#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 31347#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 31617#L116-6 assume !(add_history_type_~var~0 < 3); 31614#L116-7 add_history_type_#res := 1; 31514#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 31476#L259 assume !(0 == init_~tmp___0~1);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; 31477#L116-10 assume !!(add_history_type_~var~0 < 3); 31565#L117-4 assume !(0 == add_history_type_~history_id); 31566#L123-4 assume !(1 == add_history_type_~history_id); 31624#L129-4 assume 2 == add_history_type_~history_id;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; 31615#L171-8 assume !(0 == read_history_bool_~history_id); 31538#L181-8 assume 1 == read_history_bool_~history_id; 31539#L182-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 31382#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 31325#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 31326#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 31295#L263 assume !(0 == init_~tmp___1~1);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; 31296#L116-14 assume !!(add_history_type_~var~0 < 3); 31556#L117-6 assume !(0 == add_history_type_~history_id); 31558#L123-6 assume 1 == add_history_type_~history_id;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; 31610#L171-10 assume !(0 == read_history_bool_~history_id); 31532#L181-10 assume 1 == read_history_bool_~history_id; 31533#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 31371#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 31334#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 31320#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 31511#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 31479#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 31480#L558-2 [2018-12-02 12:39:24,016 INFO L796 eck$LassoCheckResult]: Loop: 31480#L558-2 assume !!(main_~i2~0 < 10);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;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; 31473#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 31474#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 31521#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 31470#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 31478#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; 31598#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; 31603#L409 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;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; 31754#L226-2 assume !(0 == write_history_bool_~history_id); 31750#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 31747#L578-17 assume 0 != ~gate2Failed~0 % 256; 31412#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 31365#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; 31366#L440 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;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; 31517#L226-4 assume !(0 == write_history_bool_~history_id); 31512#L231-4 assume !(1 == write_history_bool_~history_id); 31513#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 31523#L578-18 assume 0 != ~gate3Failed~0 % 256; 31578#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 31563#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; 31564#L471 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; 31575#L486 assume ~VALUE1~0 == ~VALUE2~0; 31577#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 31304#L578-19 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; 31618#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 31596#L578-20 ~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;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; 31597#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 31506#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 31605#L171-12 assume 0 == read_history_bool_~history_id; 31574#L172-12 assume !(0 == read_history_bool_~historyIndex); 31553#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 31414#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 31316#L307 assume !(0 == check_~tmp___3~0 % 256); 31318#L307-1 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; 31324#L151-7 assume 3 == read_history_int8_~history_id; 31379#L152-7 assume !(0 == read_history_int8_~historyIndex); 31380#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 31385#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 31386#L346 assume !(check_~tmp___10~0 > -2); 31544#L346-1 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; 31545#L151-9 assume 3 == read_history_int8_~history_id; 31367#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 31368#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 31374#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 31437#L366-1 check_#res := 1; 31426#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 31427#L583-72 assume !(0 == assert_~arg % 256); 31571#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 31480#L558-2 [2018-12-02 12:39:24,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash 237363222, now seen corresponding path program 3 times [2018-12-02 12:39:24,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:24,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:24,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:24,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:24,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:24,038 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:24,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:24,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:24,039 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:24,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:24,039 INFO L82 PathProgramCache]: Analyzing trace with hash 2106518894, now seen corresponding path program 1 times [2018-12-02 12:39:24,039 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:24,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:24,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:24,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:39:24,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:24,610 WARN L180 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 220 [2018-12-02 12:39:26,173 WARN L180 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 187 DAG size of output: 168 [2018-12-02 12:39:26,175 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:26,175 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:26,175 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:26,175 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:26,175 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:26,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:26,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:26,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:26,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration19_Loop [2018-12-02 12:39:26,175 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:26,175 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:26,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,317 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-02 12:39:26,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,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-12-02 12:39:26,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,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-12-02 12:39:26,697 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-12-02 12:39:29,469 WARN L180 SmtUtils]: Spent 2.59 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-12-02 12:39:29,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:29,604 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:29,609 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:29,609 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:29,611 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:29,611 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:29,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:29,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:29,627 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:29,627 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:29,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:29,641 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:29,643 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:29,643 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:29,658 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:29,658 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:29,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:39:29,685 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:41,835 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 12:39:41,840 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:41,840 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:41,840 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:41,840 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:41,840 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:39:41,840 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:41,840 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:41,840 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:41,840 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration19_Loop [2018-12-02 12:39:41,841 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:41,841 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:41,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-12-02 12:39:41,991 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-02 12:39:41,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-12-02 12:39:41,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:41,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,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-12-02 12:39:42,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,042 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,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-12-02 12:39:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:42,262 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-12-02 12:39:44,852 WARN L180 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-12-02 12:39:44,943 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:44,943 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:39:44,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,944 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,945 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,946 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,946 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,946 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,948 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,948 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,948 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,948 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,948 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,949 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,949 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,949 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,949 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,949 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,950 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,950 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,950 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,950 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,951 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,951 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,951 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,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-12-02 12:39:44,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,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-12-02 12:39:44,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,953 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,953 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,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-12-02 12:39:44,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,954 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,954 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,954 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,954 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,955 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,955 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,955 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,955 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,956 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,956 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,956 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,957 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,957 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,958 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,962 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,962 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,963 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,964 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:44,964 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:44,964 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,965 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,965 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,965 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:44,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:44,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,967 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:44,967 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:44,968 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:44,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:44,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:44,969 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:44,969 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:44,969 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:44,969 INFO L206 nArgumentSynthesizer]: 8 loop disjuncts [2018-12-02 12:39:44,969 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:44,978 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 12:39:44,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:45,015 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:39:45,100 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 12:39:45,101 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 12:39:45,101 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:39:45,101 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:39:45,101 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:39:45,101 INFO L520 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-12-02 12:39:45,102 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:39:45,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:45,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:45,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:45,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:45,407 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-12-02 12:39:45,407 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 501 states and 744 transitions. cyclomatic complexity: 250 Second operand 16 states. [2018-12-02 12:39:46,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 501 states and 744 transitions. cyclomatic complexity: 250. Second operand 16 states. Result 3932 states and 5548 transitions. Complement of second has 37 states. [2018-12-02 12:39:46,089 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-12-02 12:39:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 12:39:46,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1507 transitions. [2018-12-02 12:39:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1507 transitions. Stem has 48 letters. Loop has 48 letters. [2018-12-02 12:39:46,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:46,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1507 transitions. Stem has 96 letters. Loop has 48 letters. [2018-12-02 12:39:46,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:46,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1507 transitions. Stem has 48 letters. Loop has 96 letters. [2018-12-02 12:39:46,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:46,092 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3932 states and 5548 transitions. [2018-12-02 12:39:46,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 341 [2018-12-02 12:39:46,111 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3932 states to 2416 states and 3463 transitions. [2018-12-02 12:39:46,111 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2126 [2018-12-02 12:39:46,112 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2128 [2018-12-02 12:39:46,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2416 states and 3463 transitions. [2018-12-02 12:39:46,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:46,113 INFO L705 BuchiCegarLoop]: Abstraction has 2416 states and 3463 transitions. [2018-12-02 12:39:46,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states and 3463 transitions. [2018-12-02 12:39:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 871. [2018-12-02 12:39:46,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-12-02 12:39:46,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1272 transitions. [2018-12-02 12:39:46,129 INFO L728 BuchiCegarLoop]: Abstraction has 871 states and 1272 transitions. [2018-12-02 12:39:46,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:39:46,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:39:46,130 INFO L87 Difference]: Start difference. First operand 871 states and 1272 transitions. Second operand 4 states. [2018-12-02 12:39:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:46,231 INFO L93 Difference]: Finished difference Result 2602 states and 3807 transitions. [2018-12-02 12:39:46,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:39:46,232 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2602 states and 3807 transitions. [2018-12-02 12:39:46,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1172 [2018-12-02 12:39:46,243 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2602 states to 2602 states and 3807 transitions. [2018-12-02 12:39:46,243 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1882 [2018-12-02 12:39:46,244 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1882 [2018-12-02 12:39:46,244 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2602 states and 3807 transitions. [2018-12-02 12:39:46,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:46,244 INFO L705 BuchiCegarLoop]: Abstraction has 2602 states and 3807 transitions. [2018-12-02 12:39:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states and 3807 transitions. [2018-12-02 12:39:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 845. [2018-12-02 12:39:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2018-12-02 12:39:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1223 transitions. [2018-12-02 12:39:46,256 INFO L728 BuchiCegarLoop]: Abstraction has 845 states and 1223 transitions. [2018-12-02 12:39:46,256 INFO L608 BuchiCegarLoop]: Abstraction has 845 states and 1223 transitions. [2018-12-02 12:39:46,256 INFO L442 BuchiCegarLoop]: ======== Iteration 20============ [2018-12-02 12:39:46,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 845 states and 1223 transitions. [2018-12-02 12:39:46,281 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 333 [2018-12-02 12:39:46,282 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:46,282 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:46,282 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:46,282 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-12-02 12:39:46,282 INFO L794 eck$LassoCheckResult]: Stem: 39865#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 39614#L-1 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;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;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; 39615#L116-2 assume !!(add_history_type_~var~0 < 3); 39965#L117 assume 0 == add_history_type_~history_id;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; 39798#L171 assume 0 == read_history_bool_~history_id; 39799#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 39575#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 39780#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 39781#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 40004#L116-2 assume !(add_history_type_~var~0 < 3); 40001#L116-3 add_history_type_#res := 1; 39822#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 39823#L255 assume !(0 == init_~tmp~1);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; 39948#L116-6 assume !!(add_history_type_~var~0 < 3); 39944#L117-2 assume !(0 == add_history_type_~history_id); 39945#L123-2 assume 1 == add_history_type_~history_id;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; 40002#L171-4 assume !(0 == read_history_bool_~history_id); 39875#L181-4 assume 1 == read_history_bool_~history_id; 39876#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 39767#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 39657#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 39658#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 40028#L116-6 assume !(add_history_type_~var~0 < 3); 40024#L116-7 add_history_type_#res := 1; 39871#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 39812#L259 assume !(0 == init_~tmp___0~1);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; 39813#L116-10 assume !!(add_history_type_~var~0 < 3); 39939#L117-4 assume !(0 == add_history_type_~history_id); 39940#L123-4 assume !(1 == add_history_type_~history_id); 40046#L129-4 assume 2 == add_history_type_~history_id;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; 40025#L171-8 assume !(0 == read_history_bool_~history_id); 39901#L181-8 assume !(1 == read_history_bool_~history_id); 39673#L191-8 assume 2 == read_history_bool_~history_id; 39674#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 39783#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 39631#L131-2 assume !(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 39632#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 39588#L263 assume !(0 == init_~tmp___1~1);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; 39589#L116-14 assume !!(add_history_type_~var~0 < 3); 39926#L117-6 assume !(0 == add_history_type_~history_id); 39928#L123-6 assume 1 == add_history_type_~history_id;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; 40019#L171-10 assume !(0 == read_history_bool_~history_id); 39895#L181-10 assume 1 == read_history_bool_~history_id; 39896#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 39680#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 39643#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 39621#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 39866#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 39817#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 39818#L558-2 assume !!(main_~i2~0 < 10);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;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; 40135#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 40292#L578-16 assume 0 != ~gate1Failed~0 % 256; 39804#L391 [2018-12-02 12:39:46,283 INFO L796 eck$LassoCheckResult]: Loop: 39804#L391 assume !(~nomsg~0 != ~nomsg~0 && ~g1v_new~0 == ~nomsg~0);gate1_each_pals_period_#t~ite28 := ~g1v_new~0; 39805#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; 39819#L409 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;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; 39794#L226-2 assume !(0 == write_history_bool_~history_id); 39795#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 39827#L578-17 assume !(0 != ~gate2Failed~0 % 256);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; 40021#L427 assume 0 == gate2_each_pals_period_~next_state~1;gate2_each_pals_period_~tmp___0~4 := 1; 39738#L433-2 assume 0 != (if 0 == gate2_each_pals_period_~tmp___0~4 then 0 else 1) % 256; 39659#L439 assume gate2_each_pals_period_~next_state~1 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0;gate2_each_pals_period_#t~ite34 := gate2_each_pals_period_~next_state~1; 39660#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; 39663#L440 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;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; 40376#L226-4 assume !(0 == write_history_bool_~history_id); 40375#L231-4 assume !(1 == write_history_bool_~history_id); 40374#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 40303#L578-18 assume 0 != ~gate3Failed~0 % 256; 40236#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 40232#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; 40230#L471 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; 40228#L486 assume ~VALUE1~0 == ~VALUE2~0; 40215#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 40214#L578-19 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; 40213#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 40211#L578-20 ~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;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; 40157#L294 assume !(0 == ~gate1Failed~0 % 256); 40138#L297 assume 0 == ~gate2Failed~0 % 256;check_~tmp~2 := 1; 40054#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 40120#L171-12 assume 0 == read_history_bool_~history_id; 39950#L172-12 assume !(0 == read_history_bool_~historyIndex); 39951#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 39886#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 39887#L307 assume !(0 == check_~tmp___3~0 % 256); 40098#L307-1 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; 40097#L151-7 assume 3 == read_history_int8_~history_id; 40096#L152-7 assume !(0 == read_history_int8_~historyIndex); 39964#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 39702#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 39703#L346 assume !(check_~tmp___10~0 > -2); 39943#L346-1 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; 40073#L151-9 assume 3 == read_history_int8_~history_id; 40072#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 39962#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 40071#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 39765#L366-1 check_#res := 1; 39750#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 39751#L583-72 assume !(0 == assert_~arg % 256); 39946#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 39966#L558-2 assume !!(main_~i2~0 < 10);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;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; 39806#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 39807#L578-16 assume 0 != ~gate1Failed~0 % 256; 39804#L391 [2018-12-02 12:39:46,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 80597298, now seen corresponding path program 1 times [2018-12-02 12:39:46,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:46,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:46,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:46,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:46,299 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 12:39:46,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:39:46,300 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:46,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:46,300 INFO L82 PathProgramCache]: Analyzing trace with hash 153828093, now seen corresponding path program 1 times [2018-12-02 12:39:46,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:46,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:46,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:46,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:46,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:46,827 WARN L180 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 224 [2018-12-02 12:39:48,472 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2018-12-02 12:39:48,474 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:48,474 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:48,474 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:48,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:48,475 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:48,475 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:48,475 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:48,475 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:48,475 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-12-02 12:39:48,475 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:48,475 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,559 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,582 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:48,690 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2018-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,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-12-02 12:39:48,848 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-02 12:39:49,062 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-12-02 12:39:51,815 WARN L180 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-12-02 12:39:51,824 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:51,824 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,838 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,855 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,855 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,857 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,857 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,875 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,875 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,892 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,892 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,894 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,894 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,910 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,910 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,912 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,913 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,929 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,931 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,931 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,955 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,955 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,957 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,957 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,972 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,972 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:51,975 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:51,975 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:51,999 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:51,999 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,001 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,001 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,016 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,016 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,018 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,018 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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) Waiting until toolchain timeout for monitored process 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:52,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,037 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,037 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,059 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,059 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,074 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,074 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,076 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,076 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,094 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,109 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,109 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,111 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,111 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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) Waiting until toolchain timeout for monitored process 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:52,126 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,126 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,141 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,141 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,143 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,143 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,145 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,145 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,160 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,160 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,162 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:39:52,163 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:39:52,178 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:39:52,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:39:52,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:39:52,318 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 12:39:52,319 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:52,320 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:52,320 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:52,320 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:52,320 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:39:52,320 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:52,320 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:52,320 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:52,320 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration20_Loop [2018-12-02 12:39:52,320 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:52,320 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:52,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,340 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,343 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,352 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,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-12-02 12:39:52,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,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-12-02 12:39:52,723 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2018-12-02 12:39:52,942 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2018-12-02 12:39:56,107 WARN L180 SmtUtils]: Spent 3.05 s on a formula simplification. DAG size of input: 155 DAG size of output: 131 [2018-12-02 12:39:56,117 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:39:56,117 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:39:56,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,119 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,120 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,121 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,121 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,122 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,124 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,124 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,127 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,130 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,130 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,134 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:56,134 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:56,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,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-12-02 12:39:56,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,136 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,137 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,138 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:56,138 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:56,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,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-12-02 12:39:56,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,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-12-02 12:39:56,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,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-12-02 12:39:56,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,148 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:39:56,148 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:39:56,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:39:56,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:39:56,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-12-02 12:39:56,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:39:56,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:39:56,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:39:56,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:39:56,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:39:56,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:39:56,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:39:56,153 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:39:56,154 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:39:56,154 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:39:56,154 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:39:56,154 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:39:56,155 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:39:56,155 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-12-02 12:39:56,155 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:39:56,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:56,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:56,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:39:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:39:56,232 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-12-02 12:39:56,232 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 845 states and 1223 transitions. cyclomatic complexity: 386 Second operand 5 states. [2018-12-02 12:39:56,248 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 845 states and 1223 transitions. cyclomatic complexity: 386. Second operand 5 states. Result 1423 states and 2087 transitions. Complement of second has 6 states. [2018-12-02 12:39:56,248 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-12-02 12:39:56,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 12:39:56,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2018-12-02 12:39:56,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 647 transitions. Stem has 52 letters. Loop has 49 letters. [2018-12-02 12:39:56,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:56,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 647 transitions. Stem has 101 letters. Loop has 49 letters. [2018-12-02 12:39:56,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:56,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 647 transitions. Stem has 52 letters. Loop has 98 letters. [2018-12-02 12:39:56,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:39:56,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1423 states and 2087 transitions. [2018-12-02 12:39:56,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 243 [2018-12-02 12:39:56,253 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1423 states to 755 states and 1083 transitions. [2018-12-02 12:39:56,254 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 491 [2018-12-02 12:39:56,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 491 [2018-12-02 12:39:56,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 755 states and 1083 transitions. [2018-12-02 12:39:56,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:56,254 INFO L705 BuchiCegarLoop]: Abstraction has 755 states and 1083 transitions. [2018-12-02 12:39:56,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states and 1083 transitions. [2018-12-02 12:39:56,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2018-12-02 12:39:56,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-12-02 12:39:56,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1083 transitions. [2018-12-02 12:39:56,259 INFO L728 BuchiCegarLoop]: Abstraction has 755 states and 1083 transitions. [2018-12-02 12:39:56,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:39:56,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:39:56,259 INFO L87 Difference]: Start difference. First operand 755 states and 1083 transitions. Second operand 4 states. [2018-12-02 12:39:56,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:39:56,286 INFO L93 Difference]: Finished difference Result 1365 states and 1962 transitions. [2018-12-02 12:39:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:39:56,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1365 states and 1962 transitions. [2018-12-02 12:39:56,290 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 486 [2018-12-02 12:39:56,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1365 states to 1363 states and 1960 transitions. [2018-12-02 12:39:56,294 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 918 [2018-12-02 12:39:56,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 918 [2018-12-02 12:39:56,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1363 states and 1960 transitions. [2018-12-02 12:39:56,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:39:56,295 INFO L705 BuchiCegarLoop]: Abstraction has 1363 states and 1960 transitions. [2018-12-02 12:39:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states and 1960 transitions. [2018-12-02 12:39:56,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 755. [2018-12-02 12:39:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-12-02 12:39:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1082 transitions. [2018-12-02 12:39:56,303 INFO L728 BuchiCegarLoop]: Abstraction has 755 states and 1082 transitions. [2018-12-02 12:39:56,303 INFO L608 BuchiCegarLoop]: Abstraction has 755 states and 1082 transitions. [2018-12-02 12:39:56,303 INFO L442 BuchiCegarLoop]: ======== Iteration 21============ [2018-12-02 12:39:56,303 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 755 states and 1082 transitions. [2018-12-02 12:39:56,305 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 243 [2018-12-02 12:39:56,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:39:56,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:39:56,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:39:56,305 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-12-02 12:39:56,306 INFO L794 eck$LassoCheckResult]: Stem: 44576#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 44331#L-1 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;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;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; 44332#L116-2 assume !!(add_history_type_~var~0 < 3); 44676#L117 assume 0 == add_history_type_~history_id;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; 44514#L171 assume 0 == read_history_bool_~history_id; 44515#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 44295#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 44496#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 44497#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 44714#L116-2 assume !(add_history_type_~var~0 < 3); 44710#L116-3 add_history_type_#res := 1; 44534#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 44535#L255 assume !(0 == init_~tmp~1);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; 44658#L116-6 assume !!(add_history_type_~var~0 < 3); 44654#L117-2 assume !(0 == add_history_type_~history_id); 44655#L123-2 assume 1 == add_history_type_~history_id;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; 44711#L171-4 assume !(0 == read_history_bool_~history_id); 44587#L181-4 assume 1 == read_history_bool_~history_id; 44588#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 44491#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44377#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 44378#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 44733#L116-6 assume !(add_history_type_~var~0 < 3); 44727#L116-7 add_history_type_#res := 1; 44583#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 44529#L259 assume !(0 == init_~tmp___0~1);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; 44530#L116-10 assume !!(add_history_type_~var~0 < 3); 44650#L117-4 assume !(0 == add_history_type_~history_id); 44651#L123-4 assume !(1 == add_history_type_~history_id); 44748#L129-4 assume 2 == add_history_type_~history_id;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; 44731#L171-8 assume !(0 == read_history_bool_~history_id); 44612#L181-8 assume !(1 == read_history_bool_~history_id); 44389#L191-8 assume 2 == read_history_bool_~history_id; 44390#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 44503#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 44350#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 44351#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 44737#L116-10 assume !(add_history_type_~var~0 < 3); 44695#L116-11 add_history_type_#res := 1; 44578#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 44305#L263 assume !(0 == init_~tmp___1~1);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; 44306#L116-14 assume !!(add_history_type_~var~0 < 3); 44635#L117-6 assume !(0 == add_history_type_~history_id); 44637#L123-6 assume 1 == add_history_type_~history_id;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; 44722#L171-10 assume !(0 == read_history_bool_~history_id); 44606#L181-10 assume 1 == read_history_bool_~history_id; 44607#L182-10 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 44396#L203-10 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 44359#L125-3 assume !(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256);add_history_type_#res := 0; 44338#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 44577#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 44531#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 44532#L558-2 assume !!(main_~i2~0 < 10);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;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; 44770#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44952#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 44951#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 44591#L399 [2018-12-02 12:39:56,306 INFO L796 eck$LassoCheckResult]: Loop: 44591#L399 assume 1 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 44519#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 44526#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; 44707#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; 44641#L409 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;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; 44510#L226-2 assume !(0 == write_history_bool_~history_id); 44511#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 44538#L578-17 assume 0 != ~gate2Failed~0 % 256; 44725#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 44999#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; 44998#L440 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;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; 44997#L226-4 assume !(0 == write_history_bool_~history_id); 44995#L231-4 assume !(1 == write_history_bool_~history_id); 44992#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 44990#L578-18 assume 0 != ~gate3Failed~0 % 256; 44669#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 44645#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; 44646#L471 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; 44663#L486 assume ~VALUE1~0 == ~VALUE2~0; 44665#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 44326#L578-19 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; 44734#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 44716#L578-20 ~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;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; 44830#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 44827#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 44823#L171-12 assume 0 == read_history_bool_~history_id; 44824#L172-12 assume !(0 == read_history_bool_~historyIndex); 44814#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 44812#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 44809#L307 assume !(0 == check_~tmp___3~0 % 256); 44799#L307-1 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; 44791#L151-7 assume 3 == read_history_int8_~history_id; 44786#L152-7 assume !(0 == read_history_int8_~historyIndex); 44779#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 44673#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 44774#L346 assume !(check_~tmp___10~0 > -2); 44649#L346-1 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; 44771#L151-9 assume 3 == read_history_int8_~history_id; 44403#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 44404#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 44408#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 44481#L366-1 check_#res := 1; 44467#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 44468#L583-72 assume !(0 == assert_~arg % 256); 44656#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 44674#L558-2 assume !!(main_~i2~0 < 10);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;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; 44520#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 44521#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 44590#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 44591#L399 [2018-12-02 12:39:56,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:56,306 INFO L82 PathProgramCache]: Analyzing trace with hash -432897677, now seen corresponding path program 1 times [2018-12-02 12:39:56,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:56,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:56,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:56,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:39:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:39:56,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:39:56,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 12:39:56,324 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:39:56,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:39:56,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2028501176, now seen corresponding path program 1 times [2018-12-02 12:39:56,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:39:56,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:39:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:56,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:39:56,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:39:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:39:56,918 WARN L180 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 259 DAG size of output: 226 [2018-12-02 12:39:58,441 WARN L180 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 191 DAG size of output: 172 [2018-12-02 12:39:58,443 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:39:58,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:39:58,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:39:58,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:39:58,443 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:39:58,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:39:58,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:39:58,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:39:58,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-12-02 12:39:58,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:39:58,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:39:58,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-12-02 12:39:58,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,598 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-12-02 12:39:58,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,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-12-02 12:39:58,855 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-12-02 12:39:58,966 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2018-12-02 12:39:59,045 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 12:40:03,963 WARN L180 SmtUtils]: Spent 4.86 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-12-02 12:40:04,055 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:40:04,055 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,057 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,058 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,058 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,073 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,073 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,075 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,090 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,090 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,091 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,092 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,106 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,107 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,109 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,109 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,124 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,126 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,126 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,144 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,144 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,146 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,146 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,161 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,163 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,163 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,177 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,177 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,179 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,179 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret18=0} Honda state: {ULTIMATE.start_check_#t~ret18=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,194 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,194 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,196 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,196 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:40:04,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,212 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,212 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,227 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,227 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,229 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,229 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,249 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,249 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,251 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,266 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,268 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,268 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,284 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,284 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,298 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,301 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,301 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,316 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,319 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,319 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Honda state: {v_rep#funAddr~gate3_each_pals_period.base_13=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,334 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,334 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,336 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,336 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,350 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,350 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,352 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,353 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,370 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,370 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,384 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,385 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,386 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,386 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,401 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,401 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,403 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,403 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 82 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,432 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,432 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Honda state: {v_rep#funAddr~gate3_each_pals_period.offset_13=2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,435 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,437 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,437 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,454 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,470 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,470 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___0~2=0} Honda state: {ULTIMATE.start_check_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 86 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,487 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,487 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,518 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,519 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.offset_13=1} Honda state: {v_rep#funAddr~gate2_each_pals_period.offset_13=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,521 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,521 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,523 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,523 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,537 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,538 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,540 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,540 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Honda state: {ULTIMATE.start_write_history_bool_#in~history_id=0, ULTIMATE.start_write_history_bool_~history_id=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 90 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,554 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,554 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,556 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,556 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,570 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,571 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,572 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,572 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,587 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,587 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,589 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,589 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_#t~ret11=0} Honda state: {ULTIMATE.start_check_#t~ret11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,606 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,607 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:04,609 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:40:04,609 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:04,623 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:40:04,623 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:05,114 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:40:05,114 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:40:18,484 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 12:40:18,508 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:40:18,509 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:40:18,509 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:40:18,509 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:40:18,509 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:40:18,509 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:40:18,509 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:40:18,509 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:40:18,509 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration21_Loop [2018-12-02 12:40:18,509 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:40:18,509 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,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-12-02 12:40:18,659 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2018-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,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-12-02 12:40:18,909 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2018-12-02 12:40:19,086 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-12-02 12:40:24,300 WARN L180 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 193 DAG size of output: 145 [2018-12-02 12:40:24,391 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:40:24,391 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:40:24,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,393 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:40:24,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:40:24,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,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-12-02 12:40:24,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,411 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,412 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:40:24,412 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:40:24,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,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-12-02 12:40:24,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:40:24,417 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:40:24,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,418 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,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-12-02 12:40:24,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,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-12-02 12:40:24,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:40:24,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,421 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:40:24,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:40:24,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:40:24,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:40:24,422 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:40:24,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:40:24,422 INFO L206 nArgumentSynthesizer]: 16 loop disjuncts [2018-12-02 12:40:24,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:40:24,441 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-12-02 12:40:24,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:40:24,503 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:40:24,622 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-02 12:40:24,622 INFO L444 ModelExtractionUtils]: 18 out of 23 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-02 12:40:24,622 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:40:24,622 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:40:24,623 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:40:24,623 INFO L520 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-12-02 12:40:24,623 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:40:24,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:40:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:24,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:40:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:24,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:40:24,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:24,849 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-12-02 12:40:24,849 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 755 states and 1082 transitions. cyclomatic complexity: 335 Second operand 16 states. [2018-12-02 12:40:25,838 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 755 states and 1082 transitions. cyclomatic complexity: 335. Second operand 16 states. Result 3398 states and 4810 transitions. Complement of second has 37 states. [2018-12-02 12:40:25,839 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-12-02 12:40:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-02 12:40:25,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1683 transitions. [2018-12-02 12:40:25,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1683 transitions. Stem has 56 letters. Loop has 49 letters. [2018-12-02 12:40:25,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:40:25,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1683 transitions. Stem has 105 letters. Loop has 49 letters. [2018-12-02 12:40:25,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:40:25,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 1683 transitions. Stem has 56 letters. Loop has 98 letters. [2018-12-02 12:40:25,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:40:25,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3398 states and 4810 transitions. [2018-12-02 12:40:25,847 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 484 [2018-12-02 12:40:25,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3398 states to 2394 states and 3420 transitions. [2018-12-02 12:40:25,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1931 [2018-12-02 12:40:25,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1934 [2018-12-02 12:40:25,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2394 states and 3420 transitions. [2018-12-02 12:40:25,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:40:25,852 INFO L705 BuchiCegarLoop]: Abstraction has 2394 states and 3420 transitions. [2018-12-02 12:40:25,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2394 states and 3420 transitions. [2018-12-02 12:40:25,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2394 to 1360. [2018-12-02 12:40:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-12-02 12:40:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1957 transitions. [2018-12-02 12:40:25,863 INFO L728 BuchiCegarLoop]: Abstraction has 1360 states and 1957 transitions. [2018-12-02 12:40:25,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:40:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:40:25,863 INFO L87 Difference]: Start difference. First operand 1360 states and 1957 transitions. Second operand 3 states. [2018-12-02 12:40:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:40:25,886 INFO L93 Difference]: Finished difference Result 1308 states and 1877 transitions. [2018-12-02 12:40:25,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:40:25,886 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1308 states and 1877 transitions. [2018-12-02 12:40:25,890 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 484 [2018-12-02 12:40:25,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1308 states to 1308 states and 1877 transitions. [2018-12-02 12:40:25,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 891 [2018-12-02 12:40:25,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 891 [2018-12-02 12:40:25,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1308 states and 1877 transitions. [2018-12-02 12:40:25,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:40:25,894 INFO L705 BuchiCegarLoop]: Abstraction has 1308 states and 1877 transitions. [2018-12-02 12:40:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states and 1877 transitions. [2018-12-02 12:40:25,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2018-12-02 12:40:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2018-12-02 12:40:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1877 transitions. [2018-12-02 12:40:25,903 INFO L728 BuchiCegarLoop]: Abstraction has 1308 states and 1877 transitions. [2018-12-02 12:40:25,903 INFO L608 BuchiCegarLoop]: Abstraction has 1308 states and 1877 transitions. [2018-12-02 12:40:25,903 INFO L442 BuchiCegarLoop]: ======== Iteration 22============ [2018-12-02 12:40:25,903 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1308 states and 1877 transitions. [2018-12-02 12:40:25,904 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 484 [2018-12-02 12:40:25,904 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:40:25,904 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:40:25,905 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:40:25,905 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-12-02 12:40:25,905 INFO L794 eck$LassoCheckResult]: Stem: 51788#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 51554#L-1 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;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;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; 51555#L116-2 assume !!(add_history_type_~var~0 < 3); 51884#L117 assume 0 == add_history_type_~history_id;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; 51722#L171 assume 0 == read_history_bool_~history_id; 51723#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 51524#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 51708#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 51709#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 51928#L116-2 assume !(add_history_type_~var~0 < 3); 51925#L116-3 add_history_type_#res := 1; 51743#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 51744#L255 assume !(0 == init_~tmp~1);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; 51862#L116-6 assume !!(add_history_type_~var~0 < 3); 51858#L117-2 assume !(0 == add_history_type_~history_id); 51859#L123-2 assume 1 == add_history_type_~history_id;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; 51926#L171-4 assume !(0 == read_history_bool_~history_id); 51800#L181-4 assume 1 == read_history_bool_~history_id; 51801#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 51696#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 51589#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 51590#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 51957#L116-6 assume !(add_history_type_~var~0 < 3); 51953#L116-7 add_history_type_#res := 1; 51796#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 51738#L259 assume !(0 == init_~tmp___0~1);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; 51739#L116-10 assume !!(add_history_type_~var~0 < 3); 51854#L117-4 assume !(0 == add_history_type_~history_id); 51855#L123-4 assume !(1 == add_history_type_~history_id); 51974#L129-4 assume 2 == add_history_type_~history_id;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; 51954#L171-8 assume !(0 == read_history_bool_~history_id); 51815#L181-8 assume !(1 == read_history_bool_~history_id); 51600#L191-8 assume 2 == read_history_bool_~history_id; 51601#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 51715#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 51566#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 51567#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 51944#L116-10 assume !(add_history_type_~var~0 < 3); 51903#L116-11 add_history_type_#res := 1; 51791#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 51534#L263 assume !(0 == init_~tmp___1~1);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; 51535#L116-14 assume !!(add_history_type_~var~0 < 3); 51840#L117-6 assume !(0 == add_history_type_~history_id); 51842#L123-6 assume !(1 == add_history_type_~history_id); 51968#L129-6 assume !(2 == add_history_type_~history_id); 51685#L135-9 assume 3 == add_history_type_~history_id;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; 51686#L151-3 assume 3 == read_history_int8_~history_id; 51697#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 51698#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 51703#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 51789#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 51790#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 51740#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 51741#L558-2 assume !!(main_~i2~0 < 10);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;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; 51993#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 51946#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 51947#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 52157#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 51726#L402 [2018-12-02 12:40:25,905 INFO L796 eck$LassoCheckResult]: Loop: 51726#L402 assume !(2 == gate1_each_pals_period_~next_state~0);gate1_each_pals_period_~tmp___0~3 := 0; 51727#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 52325#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; 51922#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; 52324#L409 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;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; 52323#L226-2 assume !(0 == write_history_bool_~history_id); 52321#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 52318#L578-17 assume 0 != ~gate2Failed~0 % 256; 52319#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 52540#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; 52539#L440 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;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; 52537#L226-4 assume !(0 == write_history_bool_~history_id); 52535#L231-4 assume !(1 == write_history_bool_~history_id); 52533#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 52529#L578-18 assume 0 != ~gate3Failed~0 % 256; 52530#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 52815#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; 52814#L471 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; 52812#L486 assume ~VALUE1~0 == ~VALUE2~0; 52802#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 52801#L578-19 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; 52800#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 51939#L578-20 ~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;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; 52402#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 52399#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 52397#L171-12 assume 0 == read_history_bool_~history_id; 52398#L172-12 assume !(0 == read_history_bool_~historyIndex); 52390#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 52389#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 52387#L307 assume !(0 == check_~tmp___3~0 % 256); 52194#L307-1 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; 52379#L151-7 assume 3 == read_history_int8_~history_id; 52377#L152-7 assume !(0 == read_history_int8_~historyIndex); 52373#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 52372#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 52371#L346 assume !(check_~tmp___10~0 > -2); 51853#L346-1 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; 52186#L151-9 assume 3 == read_history_int8_~history_id; 52185#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 51879#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 52159#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 51691#L366-1 check_#res := 1; 51692#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 52729#L583-72 assume !(0 == assert_~arg % 256); 52728#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 52692#L558-2 assume !!(main_~i2~0 < 10);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;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; 52688#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 52687#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 52686#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 52329#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 51726#L402 [2018-12-02 12:40:25,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:40:25,905 INFO L82 PathProgramCache]: Analyzing trace with hash 779811470, now seen corresponding path program 1 times [2018-12-02 12:40:25,905 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:40:25,905 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:40:25,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:40:25,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:40:25,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:40:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:40:25,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:40:25,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:40:25,925 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:40:25,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:40:25,925 INFO L82 PathProgramCache]: Analyzing trace with hash -142806835, now seen corresponding path program 1 times [2018-12-02 12:40:25,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:40:25,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:40:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:40:25,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:40:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:40:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:40:25,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:40:25,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:40:25,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:40:25,941 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:40:25,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:40:25,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:40:25,941 INFO L87 Difference]: Start difference. First operand 1308 states and 1877 transitions. cyclomatic complexity: 577 Second operand 3 states. [2018-12-02 12:40:25,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:40:25,948 INFO L93 Difference]: Finished difference Result 1309 states and 1877 transitions. [2018-12-02 12:40:25,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:40:25,949 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1309 states and 1877 transitions. [2018-12-02 12:40:25,952 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 484 [2018-12-02 12:40:25,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1309 states to 1308 states and 1876 transitions. [2018-12-02 12:40:25,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 891 [2018-12-02 12:40:25,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 891 [2018-12-02 12:40:25,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1308 states and 1876 transitions. [2018-12-02 12:40:25,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:40:25,957 INFO L705 BuchiCegarLoop]: Abstraction has 1308 states and 1876 transitions. [2018-12-02 12:40:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states and 1876 transitions. [2018-12-02 12:40:25,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2018-12-02 12:40:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2018-12-02 12:40:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1876 transitions. [2018-12-02 12:40:25,970 INFO L728 BuchiCegarLoop]: Abstraction has 1308 states and 1876 transitions. [2018-12-02 12:40:25,970 INFO L608 BuchiCegarLoop]: Abstraction has 1308 states and 1876 transitions. [2018-12-02 12:40:25,970 INFO L442 BuchiCegarLoop]: ======== Iteration 23============ [2018-12-02 12:40:25,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1308 states and 1876 transitions. [2018-12-02 12:40:25,973 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 484 [2018-12-02 12:40:25,973 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:40:25,973 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:40:25,974 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 12:40:25,974 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-12-02 12:40:25,974 INFO L794 eck$LassoCheckResult]: Stem: 54407#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 54179#L-1 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;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;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; 54180#L116-2 assume !!(add_history_type_~var~0 < 3); 54502#L117 assume 0 == add_history_type_~history_id;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; 54342#L171 assume 0 == read_history_bool_~history_id; 54343#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 54149#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 54328#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 54329#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 54543#L116-2 assume !(add_history_type_~var~0 < 3); 54539#L116-3 add_history_type_#res := 1; 54363#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 54364#L255 assume !(0 == init_~tmp~1);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; 54480#L116-6 assume !!(add_history_type_~var~0 < 3); 54476#L117-2 assume !(0 == add_history_type_~history_id); 54477#L123-2 assume 1 == add_history_type_~history_id;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; 54540#L171-4 assume !(0 == read_history_bool_~history_id); 54420#L181-4 assume 1 == read_history_bool_~history_id; 54421#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 54317#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 54214#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 54215#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 54560#L116-6 assume !(add_history_type_~var~0 < 3); 54557#L116-7 add_history_type_#res := 1; 54415#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 54358#L259 assume !(0 == init_~tmp___0~1);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; 54359#L116-10 assume !!(add_history_type_~var~0 < 3); 54472#L117-4 assume !(0 == add_history_type_~history_id); 54474#L123-4 assume !(1 == add_history_type_~history_id); 54578#L129-4 assume 2 == add_history_type_~history_id;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; 54558#L171-8 assume !(0 == read_history_bool_~history_id); 54435#L181-8 assume !(1 == read_history_bool_~history_id); 54224#L191-8 assume 2 == read_history_bool_~history_id; 54225#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 54335#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 54194#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 54195#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 54551#L116-10 assume !(add_history_type_~var~0 < 3); 54520#L116-11 add_history_type_#res := 1; 54410#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 54159#L263 assume !(0 == init_~tmp___1~1);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; 54160#L116-14 assume !!(add_history_type_~var~0 < 3); 54459#L117-6 assume !(0 == add_history_type_~history_id); 54461#L123-6 assume !(1 == add_history_type_~history_id); 54571#L129-6 assume !(2 == add_history_type_~history_id); 54307#L135-9 assume 3 == add_history_type_~history_id;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; 54308#L151-3 assume 3 == read_history_int8_~history_id; 54318#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 54319#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 54324#L137-3 assume !(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0);add_history_type_#res := 0; 54408#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 54409#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 54360#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 54361#L558-2 assume !!(main_~i2~0 < 10);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;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; 55008#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 55006#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 54423#L396 assume !(0 == gate1_each_pals_period_~next_state~0); 54424#L399 assume !(1 == gate1_each_pals_period_~next_state~0); 54346#L402 WARNING: YOUR LOGFILE WAS TOO LONG, SOME LINES IN THE MIDDLE WERE REMOVED. [2018-12-02 12:41:04,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-12-02 12:41:04,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,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-12-02 12:41:04,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,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-12-02 12:41:04,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,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-12-02 12:41:04,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,939 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-12-02 12:41:04,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-12-02 12:41:04,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:04,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-12-02 12:41:05,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-12-02 12:41:05,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-12-02 12:41:05,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-12-02 12:41:05,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-12-02 12:41:05,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-12-02 12:41:05,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-12-02 12:41:05,226 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-02 12:41:07,037 WARN L180 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2018-12-02 12:41:07,111 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:41:07,111 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,115 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,115 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,123 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,123 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~gate2_each_pals_period.base_21=-1} Honda state: {v_rep#funAddr~gate2_each_pals_period.base_21=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,138 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,138 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,139 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,140 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,156 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,172 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,172 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,187 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,187 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,189 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,189 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,204 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,204 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,206 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,206 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Honda state: {ULTIMATE.start_gate1_each_pals_period_#t~ite30=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,221 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,223 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,223 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,238 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,238 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,240 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,240 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,255 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,255 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,256 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,256 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,271 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,272 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,273 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,273 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,290 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:07,290 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep#funAddr~voter.base_21=-1} Honda state: {v_rep#funAddr~voter.base_21=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:07,305 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:07,322 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:41:07,322 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:07,448 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 12:41:07,450 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:41:07,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:41:07,450 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:41:07,450 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:41:07,450 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:41:07,450 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:07,450 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:41:07,450 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:41:07,450 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration26_Loop [2018-12-02 12:41:07,450 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:41:07,450 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,663 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2018-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,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-12-02 12:41:07,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:07,952 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-02 12:41:09,944 WARN L180 SmtUtils]: Spent 1.85 s on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2018-12-02 12:41:09,974 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:41:09,974 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:41:09,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,975 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,975 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,978 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,978 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,978 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,980 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,980 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,981 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,981 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,981 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,982 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,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-12-02 12:41:09,982 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,983 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,983 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,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-12-02 12:41:09,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,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-12-02 12:41:09,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,984 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,985 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:09,985 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:09,985 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,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-12-02 12:41:09,986 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,986 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,986 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,986 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:09,986 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:09,987 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:09,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:09,987 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:09,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:09,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:09,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:09,988 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:09,988 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:09,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:09,988 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:41:09,988 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:41:09,989 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:41:09,989 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:41:09,989 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:41:09,989 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:41:09,989 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-12-02 12:41:09,989 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:41:10,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:10,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:10,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:10,101 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-12-02 12:41:10,101 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1452 states and 2063 transitions. cyclomatic complexity: 619 Second operand 5 states. [2018-12-02 12:41:10,120 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1452 states and 2063 transitions. cyclomatic complexity: 619. Second operand 5 states. Result 3154 states and 4517 transitions. Complement of second has 6 states. [2018-12-02 12:41:10,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-12-02 12:41:10,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 12:41:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2018-12-02 12:41:10,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 596 transitions. Stem has 80 letters. Loop has 50 letters. [2018-12-02 12:41:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:41:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 596 transitions. Stem has 130 letters. Loop has 50 letters. [2018-12-02 12:41:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:41:10,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 596 transitions. Stem has 80 letters. Loop has 100 letters. [2018-12-02 12:41:10,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:41:10,122 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3154 states and 4517 transitions. [2018-12-02 12:41:10,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 475 [2018-12-02 12:41:10,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3154 states to 1444 states and 2023 transitions. [2018-12-02 12:41:10,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1027 [2018-12-02 12:41:10,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1027 [2018-12-02 12:41:10,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1444 states and 2023 transitions. [2018-12-02 12:41:10,135 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:10,135 INFO L705 BuchiCegarLoop]: Abstraction has 1444 states and 2023 transitions. [2018-12-02 12:41:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states and 2023 transitions. [2018-12-02 12:41:10,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1444. [2018-12-02 12:41:10,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1444 states. [2018-12-02 12:41:10,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1444 states to 1444 states and 2023 transitions. [2018-12-02 12:41:10,145 INFO L728 BuchiCegarLoop]: Abstraction has 1444 states and 2023 transitions. [2018-12-02 12:41:10,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:41:10,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:41:10,146 INFO L87 Difference]: Start difference. First operand 1444 states and 2023 transitions. Second operand 4 states. [2018-12-02 12:41:10,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:41:10,190 INFO L93 Difference]: Finished difference Result 2536 states and 3503 transitions. [2018-12-02 12:41:10,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:41:10,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2536 states and 3503 transitions. [2018-12-02 12:41:10,194 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 874 [2018-12-02 12:41:10,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2536 states to 2536 states and 3503 transitions. [2018-12-02 12:41:10,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1704 [2018-12-02 12:41:10,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1704 [2018-12-02 12:41:10,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2536 states and 3503 transitions. [2018-12-02 12:41:10,198 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:10,198 INFO L705 BuchiCegarLoop]: Abstraction has 2536 states and 3503 transitions. [2018-12-02 12:41:10,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2536 states and 3503 transitions. [2018-12-02 12:41:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2536 to 1998. [2018-12-02 12:41:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1998 states. [2018-12-02 12:41:10,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1998 states to 1998 states and 2766 transitions. [2018-12-02 12:41:10,212 INFO L728 BuchiCegarLoop]: Abstraction has 1998 states and 2766 transitions. [2018-12-02 12:41:10,212 INFO L608 BuchiCegarLoop]: Abstraction has 1998 states and 2766 transitions. [2018-12-02 12:41:10,212 INFO L442 BuchiCegarLoop]: ======== Iteration 27============ [2018-12-02 12:41:10,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1998 states and 2766 transitions. [2018-12-02 12:41:10,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 625 [2018-12-02 12:41:10,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:41:10,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:41:10,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:41:10,215 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-12-02 12:41:10,215 INFO L794 eck$LassoCheckResult]: Stem: 84929#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 84695#L-1 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;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;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; 84696#L116-2 assume !!(add_history_type_~var~0 < 3); 85022#L117 assume 0 == add_history_type_~history_id;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; 84866#L171 assume 0 == read_history_bool_~history_id; 84867#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 84662#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 84852#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 84853#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85063#L116-2 assume !(add_history_type_~var~0 < 3); 85060#L116-3 add_history_type_#res := 1; 84884#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 84885#L255 assume !(0 == init_~tmp~1);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; 85005#L116-6 assume !!(add_history_type_~var~0 < 3); 85000#L117-2 assume !(0 == add_history_type_~history_id); 85001#L123-2 assume 1 == add_history_type_~history_id;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; 85061#L171-4 assume !(0 == read_history_bool_~history_id); 84941#L181-4 assume 1 == read_history_bool_~history_id; 84942#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 84839#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 84731#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 84732#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85085#L116-6 assume !(add_history_type_~var~0 < 3); 85080#L116-7 add_history_type_#res := 1; 84937#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 84876#L259 assume !(0 == init_~tmp___0~1);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; 84877#L116-10 assume !!(add_history_type_~var~0 < 3); 84994#L117-4 assume !(0 == add_history_type_~history_id); 84996#L123-4 assume !(1 == add_history_type_~history_id); 85106#L129-4 assume 2 == add_history_type_~history_id;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; 85081#L171-8 assume !(0 == read_history_bool_~history_id); 84958#L181-8 assume !(1 == read_history_bool_~history_id); 84741#L191-8 assume 2 == read_history_bool_~history_id; 84742#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 84855#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 84707#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 84708#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 85073#L116-10 assume !(add_history_type_~var~0 < 3); 85043#L116-11 add_history_type_#res := 1; 84932#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 84675#L263 assume !(0 == init_~tmp___1~1);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; 84676#L116-14 assume !!(add_history_type_~var~0 < 3); 84982#L117-6 assume !(0 == add_history_type_~history_id); 84984#L123-6 assume !(1 == add_history_type_~history_id); 85095#L129-6 assume !(2 == add_history_type_~history_id); 84830#L135-9 assume 3 == add_history_type_~history_id;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; 84831#L151-3 assume 3 == read_history_int8_~history_id; 84840#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 84841#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 84848#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 84826#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 84827#L116-14 assume !(add_history_type_~var~0 < 3); 85037#L116-15 add_history_type_#res := 1; 84930#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 84931#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 84882#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 84883#L558-2 assume !!(main_~i2~0 < 10);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;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; 85457#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 85455#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 85444#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 85445#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 86023#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; 86018#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; 86017#L409 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;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; 86016#L226-2 assume !(0 == write_history_bool_~history_id); 86008#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 86000#L578-17 assume 0 != ~gate2Failed~0 % 256; 85996#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 85993#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; 85991#L440 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;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; 85990#L226-4 assume !(0 == write_history_bool_~history_id); 85989#L231-4 assume !(1 == write_history_bool_~history_id); 85986#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 85980#L578-18 assume 0 != ~gate3Failed~0 % 256; 85982#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 86442#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; 86441#L471 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; 86437#L486 assume ~VALUE1~0 == ~VALUE2~0; 86434#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 86432#L578-19 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; 86428#L211 assume !(3 == write_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 86429#L583-40 [2018-12-02 12:41:10,216 INFO L796 eck$LassoCheckResult]: Loop: 86429#L583-40 assume !(0 == assert_~arg % 256); 85861#L578-20 ~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;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; 85862#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 86543#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 85775#L171-12 assume 0 == read_history_bool_~history_id; 85777#L172-12 assume !(0 == read_history_bool_~historyIndex); 85713#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 85714#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 85745#L307 assume !(0 == check_~tmp___3~0 % 256); 85643#L307-1 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; 85642#L151-7 assume 3 == read_history_int8_~history_id; 85641#L152-7 assume !(0 == read_history_int8_~historyIndex); 85639#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 85618#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 85616#L346 assume !(check_~tmp___10~0 > -2); 85026#L346-1 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; 85610#L151-9 assume 3 == read_history_int8_~history_id; 85608#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 85019#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 85604#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 84980#L366-1 check_#res := 1; 86125#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 86123#L583-72 assume !(0 == assert_~arg % 256); 86118#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 86113#L558-2 assume !!(main_~i2~0 < 10);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;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; 86109#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 86108#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 86107#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 86106#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 86105#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; 86099#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; 86098#L409 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;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; 86097#L226-2 assume !(0 == write_history_bool_~history_id); 86095#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 86091#L578-17 assume 0 != ~gate2Failed~0 % 256; 86093#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 86637#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; 86634#L440 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;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; 86632#L226-4 assume !(0 == write_history_bool_~history_id); 86630#L231-4 assume !(1 == write_history_bool_~history_id); 84948#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 84949#L578-18 assume 0 != ~gate3Failed~0 % 256; 85084#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 86645#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; 86203#L471 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; 86201#L486 assume !(~VALUE1~0 == ~VALUE2~0); 86198#L493 assume ~VALUE1~0 == ~VALUE3~0; 86199#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 85868#L578-19 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; 85869#L211 assume !(3 == write_history_int8_~history_id);assert_#in~arg := 0;havoc assert_~arg;assert_~arg := assert_#in~arg; 86429#L583-40 [2018-12-02 12:41:10,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash -800201156, now seen corresponding path program 1 times [2018-12-02 12:41:10,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:10,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:10,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:41:10,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:41:10,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:41:10,238 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:41:10,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:10,238 INFO L82 PathProgramCache]: Analyzing trace with hash 621115297, now seen corresponding path program 1 times [2018-12-02 12:41:10,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:10,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:10,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-12-02 12:41:10,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:41:10,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:41:10,260 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:41:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:41:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:41:10,261 INFO L87 Difference]: Start difference. First operand 1998 states and 2766 transitions. cyclomatic complexity: 776 Second operand 3 states. [2018-12-02 12:41:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:41:10,271 INFO L93 Difference]: Finished difference Result 2006 states and 2742 transitions. [2018-12-02 12:41:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:41:10,271 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2006 states and 2742 transitions. [2018-12-02 12:41:10,277 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 609 [2018-12-02 12:41:10,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2006 states to 2006 states and 2742 transitions. [2018-12-02 12:41:10,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1303 [2018-12-02 12:41:10,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1303 [2018-12-02 12:41:10,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2006 states and 2742 transitions. [2018-12-02 12:41:10,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:10,282 INFO L705 BuchiCegarLoop]: Abstraction has 2006 states and 2742 transitions. [2018-12-02 12:41:10,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2006 states and 2742 transitions. [2018-12-02 12:41:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2006 to 1982. [2018-12-02 12:41:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-12-02 12:41:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2718 transitions. [2018-12-02 12:41:10,299 INFO L728 BuchiCegarLoop]: Abstraction has 1982 states and 2718 transitions. [2018-12-02 12:41:10,299 INFO L608 BuchiCegarLoop]: Abstraction has 1982 states and 2718 transitions. [2018-12-02 12:41:10,299 INFO L442 BuchiCegarLoop]: ======== Iteration 28============ [2018-12-02 12:41:10,299 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1982 states and 2718 transitions. [2018-12-02 12:41:10,304 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 609 [2018-12-02 12:41:10,304 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:41:10,304 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:41:10,305 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:41:10,305 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-12-02 12:41:10,305 INFO L794 eck$LassoCheckResult]: Stem: 88936#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 88706#L-1 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;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;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; 88707#L116-2 assume !!(add_history_type_~var~0 < 3); 89032#L117 assume 0 == add_history_type_~history_id;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; 88872#L171 assume 0 == read_history_bool_~history_id; 88873#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 88673#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 88858#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 88859#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 89070#L116-2 assume !(add_history_type_~var~0 < 3); 89067#L116-3 add_history_type_#res := 1; 88892#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 88893#L255 assume !(0 == init_~tmp~1);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; 89008#L116-6 assume !!(add_history_type_~var~0 < 3); 89004#L117-2 assume !(0 == add_history_type_~history_id); 89005#L123-2 assume 1 == add_history_type_~history_id;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; 89068#L171-4 assume !(0 == read_history_bool_~history_id); 88948#L181-4 assume 1 == read_history_bool_~history_id; 88949#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 88844#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 88743#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 88744#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 89098#L116-6 assume !(add_history_type_~var~0 < 3); 89090#L116-7 add_history_type_#res := 1; 88944#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 88882#L259 assume !(0 == init_~tmp___0~1);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; 88883#L116-10 assume !!(add_history_type_~var~0 < 3); 88999#L117-4 assume !(0 == add_history_type_~history_id); 89001#L123-4 assume !(1 == add_history_type_~history_id); 89119#L129-4 assume 2 == add_history_type_~history_id;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; 89091#L171-8 assume !(0 == read_history_bool_~history_id); 88962#L181-8 assume !(1 == read_history_bool_~history_id); 88753#L191-8 assume 2 == read_history_bool_~history_id; 88754#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 88861#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 88718#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 88719#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 89082#L116-10 assume !(add_history_type_~var~0 < 3); 89047#L116-11 add_history_type_#res := 1; 88939#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 88686#L263 assume !(0 == init_~tmp___1~1);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; 88687#L116-14 assume !!(add_history_type_~var~0 < 3); 88986#L117-6 assume !(0 == add_history_type_~history_id); 88988#L123-6 assume !(1 == add_history_type_~history_id); 89108#L129-6 assume !(2 == add_history_type_~history_id); 88836#L135-9 assume 3 == add_history_type_~history_id;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; 88837#L151-3 assume 3 == read_history_int8_~history_id; 88845#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 88846#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 88853#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 88832#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 88833#L116-14 assume !(add_history_type_~var~0 < 3); 89043#L116-15 add_history_type_#res := 1; 88937#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 88938#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 88888#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 88889#L558-2 assume !!(main_~i2~0 < 10);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;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; 88876#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 88877#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 88951#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 88884#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 88885#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; 89064#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; 88990#L409 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;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; 88868#L226-2 assume !(0 == write_history_bool_~history_id); 88869#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 88897#L578-17 assume 0 != ~gate2Failed~0 % 256; 88817#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 88759#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; 88760#L440 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;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; 89076#L226-4 assume !(0 == write_history_bool_~history_id); 89077#L231-4 assume !(1 == write_history_bool_~history_id); 88954#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 88955#L578-18 assume 0 != ~gate3Failed~0 % 256; 89022#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 89023#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; 90640#L471 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; 90638#L486 assume ~VALUE1~0 == ~VALUE2~0; 90636#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 90590#L578-19 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; 90586#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 90583#L578-20 ~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;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; 90567#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 90565#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 89079#L171-12 assume 0 == read_history_bool_~history_id; 89010#L172-12 assume !(0 == read_history_bool_~historyIndex); 89011#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 88960#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 88712#L307 assume !(0 == check_~tmp___3~0 % 256); 88714#L307-1 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; 88722#L151-7 assume 3 == read_history_int8_~history_id; 88774#L152-7 assume !(0 == read_history_int8_~historyIndex); 88775#L155-7 assume !(1 == read_history_int8_~historyIndex);read_history_int8_#res := ~votedValue_History_2~0; 89031#L163-7 [2018-12-02 12:41:10,363 INFO L796 eck$LassoCheckResult]: Loop: 89031#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 89397#L346 assume !(check_~tmp___10~0 > -2); 89549#L346-1 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; 89597#L151-9 assume 3 == read_history_int8_~history_id; 89593#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 89592#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 89591#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 89547#L366-1 check_#res := 1; 89539#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 89538#L583-72 assume !(0 == assert_~arg % 256); 89537#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 89536#L558-2 assume !!(main_~i2~0 < 10);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;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; 89529#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 89527#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 89525#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 89526#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 90064#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; 90063#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; 90062#L409 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;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; 90061#L226-2 assume !(0 == write_history_bool_~history_id); 90057#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 90053#L578-17 assume 0 != ~gate2Failed~0 % 256; 90051#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 90049#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; 90047#L440 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;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; 90045#L226-4 assume !(0 == write_history_bool_~history_id); 90043#L231-4 assume !(1 == write_history_bool_~history_id); 90040#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 90035#L578-18 assume 0 != ~gate3Failed~0 % 256; 90036#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 90230#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; 90228#L471 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; 90222#L486 assume ~VALUE1~0 == ~VALUE2~0; 90212#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 89826#L578-19 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; 90211#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 90210#L578-20 ~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;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; 89948#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 89946#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 89944#L171-12 assume 0 == read_history_bool_~history_id; 89945#L172-12 assume !(0 == read_history_bool_~historyIndex); 89931#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 89929#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 89926#L307 assume !(0 == check_~tmp___3~0 % 256); 89406#L307-1 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; 89404#L151-7 assume 3 == read_history_int8_~history_id; 89401#L152-7 assume !(0 == read_history_int8_~historyIndex); 89399#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 89031#L163-7 [2018-12-02 12:41:10,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:10,452 INFO L82 PathProgramCache]: Analyzing trace with hash 154696811, now seen corresponding path program 1 times [2018-12-02 12:41:10,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:10,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 12:41:10,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:41:10,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:41:10,475 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:41:10,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:10,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1900612940, now seen corresponding path program 4 times [2018-12-02 12:41:10,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:10,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:10,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:41:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:41:11,020 WARN L180 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 254 DAG size of output: 221 [2018-12-02 12:41:12,645 WARN L180 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 181 DAG size of output: 162 [2018-12-02 12:41:12,647 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:41:12,647 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:41:12,647 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:41:12,647 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:41:12,647 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:41:12,648 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:12,648 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:41:12,648 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:41:12,648 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration28_Loop [2018-12-02 12:41:12,648 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:41:12,648 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,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-12-02 12:41:12,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:12,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-12-02 12:41:13,129 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-12-02 12:41:15,807 WARN L180 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2018-12-02 12:41:15,849 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:41:15,849 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,851 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,851 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,855 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,874 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,874 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,894 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,894 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,896 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,911 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,911 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,913 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,913 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,928 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,928 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,930 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,930 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,952 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,954 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,954 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,968 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,969 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,970 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,970 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:15,985 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:15,985 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:15,987 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:15,987 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,005 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,022 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,022 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,037 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,039 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,040 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,058 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,060 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,060 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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) Waiting until toolchain timeout for monitored process 146 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:16,075 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,075 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,077 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,078 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,093 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,093 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,095 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,095 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,110 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,112 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,112 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,134 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,134 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,154 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,154 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,156 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,156 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,171 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,171 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,173 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,193 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,193 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,194 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,195 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,228 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,228 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,231 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,231 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,233 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,233 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,248 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,248 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,249 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,249 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,267 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,267 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,288 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,288 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,289 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,289 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 158 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 158 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:16,305 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,305 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,307 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 159 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 159 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:16,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,321 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,323 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,324 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 160 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 160 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:16,344 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,344 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,345 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,346 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 161 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 161 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:16,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,361 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,362 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,362 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,378 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,378 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,379 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,379 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,394 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,394 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,396 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,396 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,412 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,412 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,415 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,415 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,430 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,430 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,432 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,432 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,447 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,447 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,450 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,450 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,470 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,470 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,472 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,472 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,487 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,487 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,489 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,489 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,504 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,504 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,505 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,505 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,520 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,520 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,530 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,530 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_write_history_bool_~buf=168, ~gate3Failed_History_1~0=168, ~gate3Failed_History_2~0=168, ~gate3Failed_History_0~0=168, ~gate3Failed~0=168, ULTIMATE.start_write_history_bool_#in~buf=168} Honda state: {ULTIMATE.start_write_history_bool_~buf=168, ~gate3Failed_History_1~0=168, ~gate3Failed_History_2~0=168, ~gate3Failed_History_0~0=168, ~gate3Failed~0=168, ULTIMATE.start_write_history_bool_#in~buf=168} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,544 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,546 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,546 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,561 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,561 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,564 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,564 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,586 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,586 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,601 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,601 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,602 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,602 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,617 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,617 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,619 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,619 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,634 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,636 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,636 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Honda state: {ULTIMATE.start_read_history_int8_#in~history_id=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,651 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,651 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,653 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,653 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,668 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,668 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,670 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,670 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 179 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 179 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:16,685 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,685 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,687 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,688 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_read_history_bool_~history_id=0, ULTIMATE.start_read_history_bool_#in~history_id=0} Honda state: {ULTIMATE.start_read_history_bool_~history_id=0, 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,705 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,705 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,720 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,722 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,722 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,738 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,738 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Honda state: {ULTIMATE.start_gate3_each_pals_period_#t~ite38=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,754 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,754 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:16,755 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:16,755 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_check_~tmp___8~0=0} Honda state: {ULTIMATE.start_check_~tmp___8~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,770 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:16,770 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:16,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:41:16,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:28,854 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 12:41:28,859 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:41:28,859 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:41:28,859 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:41:28,859 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:41:28,859 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:41:28,859 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:28,859 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:41:28,859 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:41:28,859 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration28_Loop [2018-12-02 12:41:28,859 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:41:28,859 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:28,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-12-02 12:41:29,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-12-02 12:41:29,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,047 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:29,326 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-12-02 12:41:31,660 WARN L180 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 150 DAG size of output: 126 [2018-12-02 12:41:31,694 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:41:31,694 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:41:31,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,704 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,705 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,712 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:31,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:31,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,717 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,719 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,719 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,720 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:31,721 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:31,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,723 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,724 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,725 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,726 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,726 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,727 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,729 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,734 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,736 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:31,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:31,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:31,739 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:31,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,742 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,743 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,743 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,746 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:31,746 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:31,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,748 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,748 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,748 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,749 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,756 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,759 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,761 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,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-12-02 12:41:31,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,814 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,815 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,816 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,816 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,816 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,816 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,816 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,817 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:41:31,817 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:41:31,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,918 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:41:31,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:41:31,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:41:31,919 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:41:31,919 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:41:31,919 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:41:31,919 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:41:31,919 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:41:31,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:41:31,919 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:41:31,920 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:41:31,920 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:41:31,920 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:41:31,920 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:41:31,920 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:41:31,920 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-12-02 12:41:31,920 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:41:31,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:31,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:31,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:31,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:32,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:32,020 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-12-02 12:41:32,020 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1982 states and 2718 transitions. cyclomatic complexity: 744 Second operand 5 states. [2018-12-02 12:41:32,044 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1982 states and 2718 transitions. cyclomatic complexity: 744. Second operand 5 states. Result 4216 states and 5804 transitions. Complement of second has 6 states. [2018-12-02 12:41:32,044 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-12-02 12:41:32,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 12:41:32,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 587 transitions. [2018-12-02 12:41:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 587 transitions. Stem has 93 letters. Loop has 48 letters. [2018-12-02 12:41:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:41:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 587 transitions. Stem has 141 letters. Loop has 48 letters. [2018-12-02 12:41:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:41:32,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 587 transitions. Stem has 93 letters. Loop has 96 letters. [2018-12-02 12:41:32,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:41:32,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4216 states and 5804 transitions. [2018-12-02 12:41:32,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 609 [2018-12-02 12:41:32,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4216 states to 1982 states and 2714 transitions. [2018-12-02 12:41:32,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1295 [2018-12-02 12:41:32,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1295 [2018-12-02 12:41:32,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1982 states and 2714 transitions. [2018-12-02 12:41:32,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:32,055 INFO L705 BuchiCegarLoop]: Abstraction has 1982 states and 2714 transitions. [2018-12-02 12:41:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states and 2714 transitions. [2018-12-02 12:41:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2018-12-02 12:41:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-12-02 12:41:32,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2714 transitions. [2018-12-02 12:41:32,064 INFO L728 BuchiCegarLoop]: Abstraction has 1982 states and 2714 transitions. [2018-12-02 12:41:32,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:41:32,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:41:32,065 INFO L87 Difference]: Start difference. First operand 1982 states and 2714 transitions. Second operand 3 states. [2018-12-02 12:41:32,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:41:32,099 INFO L93 Difference]: Finished difference Result 3383 states and 4604 transitions. [2018-12-02 12:41:32,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:41:32,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3383 states and 4604 transitions. [2018-12-02 12:41:32,146 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1142 [2018-12-02 12:41:32,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3383 states to 3383 states and 4604 transitions. [2018-12-02 12:41:32,149 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2267 [2018-12-02 12:41:32,149 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2267 [2018-12-02 12:41:32,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3383 states and 4604 transitions. [2018-12-02 12:41:32,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:32,149 INFO L705 BuchiCegarLoop]: Abstraction has 3383 states and 4604 transitions. [2018-12-02 12:41:32,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3383 states and 4604 transitions. [2018-12-02 12:41:32,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3383 to 1982. [2018-12-02 12:41:32,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2018-12-02 12:41:32,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 2714 transitions. [2018-12-02 12:41:32,161 INFO L728 BuchiCegarLoop]: Abstraction has 1982 states and 2714 transitions. [2018-12-02 12:41:32,161 INFO L608 BuchiCegarLoop]: Abstraction has 1982 states and 2714 transitions. [2018-12-02 12:41:32,161 INFO L442 BuchiCegarLoop]: ======== Iteration 29============ [2018-12-02 12:41:32,161 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1982 states and 2714 transitions. [2018-12-02 12:41:32,163 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 609 [2018-12-02 12:41:32,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:41:32,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:41:32,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:41:32,164 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-12-02 12:41:32,164 INFO L794 eck$LassoCheckResult]: Stem: 100946#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 100715#L-1 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;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;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; 100716#L116-2 assume !!(add_history_type_~var~0 < 3); 101047#L117 assume 0 == add_history_type_~history_id;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; 100879#L171 assume 0 == read_history_bool_~history_id; 100880#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 100685#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 100865#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 100866#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 101090#L116-2 assume !(add_history_type_~var~0 < 3); 101086#L116-3 add_history_type_#res := 1; 100899#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 100900#L255 assume !(0 == init_~tmp~1);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; 101024#L116-6 assume !!(add_history_type_~var~0 < 3); 101020#L117-2 assume !(0 == add_history_type_~history_id); 101021#L123-2 assume 1 == add_history_type_~history_id;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; 101087#L171-4 assume !(0 == read_history_bool_~history_id); 100958#L181-4 assume 1 == read_history_bool_~history_id; 100959#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 100854#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 100756#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 100757#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 101106#L116-6 assume !(add_history_type_~var~0 < 3); 101103#L116-7 add_history_type_#res := 1; 100954#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 100893#L259 assume !(0 == init_~tmp___0~1);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; 100894#L116-10 assume !!(add_history_type_~var~0 < 3); 101016#L117-4 assume !(0 == add_history_type_~history_id); 101018#L123-4 assume !(1 == add_history_type_~history_id); 101131#L129-4 assume 2 == add_history_type_~history_id;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; 101104#L171-8 assume !(0 == read_history_bool_~history_id); 100975#L181-8 assume !(1 == read_history_bool_~history_id); 100762#L191-8 assume 2 == read_history_bool_~history_id; 100763#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 100872#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 100730#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 100731#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 101099#L116-10 assume !(add_history_type_~var~0 < 3); 101069#L116-11 add_history_type_#res := 1; 100949#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 100695#L263 assume !(0 == init_~tmp___1~1);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; 100696#L116-14 assume !!(add_history_type_~var~0 < 3); 101001#L117-6 assume !(0 == add_history_type_~history_id); 101003#L123-6 assume !(1 == add_history_type_~history_id); 101120#L129-6 assume !(2 == add_history_type_~history_id); 100844#L135-9 assume 3 == add_history_type_~history_id;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; 100845#L151-3 assume 3 == read_history_int8_~history_id; 100855#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 100856#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 100861#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 100840#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 100841#L116-14 assume !(add_history_type_~var~0 < 3); 101059#L116-15 add_history_type_#res := 1; 100947#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 100948#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 100895#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 100896#L558-2 assume !!(main_~i2~0 < 10);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;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; 101586#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 101631#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 101627#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 100889#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 100890#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; 101091#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; 101005#L409 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;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; 101006#L226-2 assume !(0 == write_history_bool_~history_id); 102604#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 102600#L578-17 assume 0 != ~gate2Failed~0 % 256; 102598#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 102596#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; 102594#L440 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;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; 102592#L226-4 assume !(0 == write_history_bool_~history_id); 102589#L231-4 assume !(1 == write_history_bool_~history_id); 102586#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 102583#L578-18 assume 0 != ~gate3Failed~0 % 256; 102584#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 102646#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; 102645#L471 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; 102644#L486 assume ~VALUE1~0 == ~VALUE2~0; 102641#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 102162#L578-19 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; 102639#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 102637#L578-20 ~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;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; 102482#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 102331#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 102326#L171-12 assume 0 == read_history_bool_~history_id; 102327#L172-12 assume !(0 == read_history_bool_~historyIndex); 102313#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 102311#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 102307#L307 assume !(0 == check_~tmp___3~0 % 256); 100727#L307-1 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; 100728#L151-7 assume 3 == read_history_int8_~history_id; 100783#L152-7 assume !(0 == read_history_int8_~historyIndex); 100784#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 100787#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 100788#L346 assume check_~tmp___10~0 > -2;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; 101000#L151-8 [2018-12-02 12:41:32,759 INFO L796 eck$LassoCheckResult]: Loop: 101000#L151-8 assume 3 == read_history_int8_~history_id; 100779#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 100780#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 100782#L348 assume check_~tmp___6~0 == ~nomsg~0;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; 101050#L171-15 assume 0 == read_history_bool_~history_id; 101062#L172-15 assume !(0 == read_history_bool_~historyIndex); 100989#L175-15 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 100915#L203-15 check_#t~ret20 := read_history_bool_#res;check_~tmp___7~0 := check_#t~ret20;havoc check_#t~ret20; 100916#L350 assume !(0 != check_~tmp___7~0 % 256);check_#res := 0; 101647#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 101645#L583-72 assume !(0 == assert_~arg % 256); 101643#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 101641#L558-2 assume !!(main_~i2~0 < 10);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;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; 101622#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 101610#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 101611#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 101852#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 101850#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; 101848#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; 101846#L409 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;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; 101844#L226-2 assume !(0 == write_history_bool_~history_id); 101840#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 101835#L578-17 assume 0 != ~gate2Failed~0 % 256; 101832#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 101831#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; 101830#L440 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;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; 101826#L226-4 assume !(0 == write_history_bool_~history_id); 101824#L231-4 assume !(1 == write_history_bool_~history_id); 101822#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 101818#L578-18 assume 0 != ~gate3Failed~0 % 256; 101819#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 102188#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; 102183#L471 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; 102178#L486 assume ~VALUE1~0 == ~VALUE2~0; 102179#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 102232#L578-19 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; 102227#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 102225#L578-20 ~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;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; 101772#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 101770#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 101769#L171-12 assume 0 == read_history_bool_~history_id; 101768#L172-12 assume !(0 == read_history_bool_~historyIndex); 101761#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 101760#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 101759#L307 assume !(0 == check_~tmp___3~0 % 256); 101690#L307-1 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; 101118#L151-7 assume 3 == read_history_int8_~history_id; 101119#L152-7 assume !(0 == read_history_int8_~historyIndex); 101043#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 101044#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 100998#L346 assume check_~tmp___10~0 > -2;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; 101000#L151-8 [2018-12-02 12:41:33,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:33,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1660168852, now seen corresponding path program 1 times [2018-12-02 12:41:33,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:33,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:33,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:41:33,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:33,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:41:33,130 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 186 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:41:33,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:33,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:33,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:33,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:41:33,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-12-02 12:41:33,212 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:41:33,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:33,212 INFO L82 PathProgramCache]: Analyzing trace with hash 478764120, now seen corresponding path program 1 times [2018-12-02 12:41:33,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:33,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:33,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:41:33,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:41:33,227 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:41:33,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 12:41:33,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 12:41:33,227 INFO L87 Difference]: Start difference. First operand 1982 states and 2714 transitions. cyclomatic complexity: 740 Second operand 4 states. [2018-12-02 12:41:33,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:41:33,256 INFO L93 Difference]: Finished difference Result 1940 states and 2562 transitions. [2018-12-02 12:41:33,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:41:33,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1940 states and 2562 transitions. [2018-12-02 12:41:33,261 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 557 [2018-12-02 12:41:33,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1940 states to 1828 states and 2436 transitions. [2018-12-02 12:41:33,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1194 [2018-12-02 12:41:33,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1194 [2018-12-02 12:41:33,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1828 states and 2436 transitions. [2018-12-02 12:41:33,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:33,264 INFO L705 BuchiCegarLoop]: Abstraction has 1828 states and 2436 transitions. [2018-12-02 12:41:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states and 2436 transitions. [2018-12-02 12:41:33,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1828. [2018-12-02 12:41:33,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1828 states. [2018-12-02 12:41:33,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1828 states to 1828 states and 2436 transitions. [2018-12-02 12:41:33,279 INFO L728 BuchiCegarLoop]: Abstraction has 1828 states and 2436 transitions. [2018-12-02 12:41:33,279 INFO L608 BuchiCegarLoop]: Abstraction has 1828 states and 2436 transitions. [2018-12-02 12:41:33,296 INFO L442 BuchiCegarLoop]: ======== Iteration 30============ [2018-12-02 12:41:33,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1828 states and 2436 transitions. [2018-12-02 12:41:33,300 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 557 [2018-12-02 12:41:33,300 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:41:33,301 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:41:33,301 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:41:33,302 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-12-02 12:41:33,302 INFO L794 eck$LassoCheckResult]: Stem: 105159#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 104929#L-1 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;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;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; 104930#L116-2 assume !!(add_history_type_~var~0 < 3); 105249#L117 assume 0 == add_history_type_~history_id;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; 105092#L171 assume 0 == read_history_bool_~history_id; 105093#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 104904#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 105082#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 105083#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 105288#L116-2 assume !(add_history_type_~var~0 < 3); 105286#L116-3 add_history_type_#res := 1; 105110#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 105111#L255 assume !(0 == init_~tmp~1);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; 105233#L116-6 assume !!(add_history_type_~var~0 < 3); 105229#L117-2 assume !(0 == add_history_type_~history_id); 105230#L123-2 assume 1 == add_history_type_~history_id;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; 105287#L171-4 assume !(0 == read_history_bool_~history_id); 105171#L181-4 assume 1 == read_history_bool_~history_id; 105172#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 105069#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 104963#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 104964#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 105308#L116-6 assume !(add_history_type_~var~0 < 3); 105302#L116-7 add_history_type_#res := 1; 105167#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 105101#L259 assume !(0 == init_~tmp___0~1);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; 105102#L116-10 assume !!(add_history_type_~var~0 < 3); 105224#L117-4 assume !(0 == add_history_type_~history_id); 105226#L123-4 assume !(1 == add_history_type_~history_id); 105334#L129-4 assume 2 == add_history_type_~history_id;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; 105303#L171-8 assume !(0 == read_history_bool_~history_id); 105187#L181-8 assume !(1 == read_history_bool_~history_id); 104974#L191-8 assume 2 == read_history_bool_~history_id; 104975#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 105189#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 104941#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 104942#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 105295#L116-10 assume !(add_history_type_~var~0 < 3); 105272#L116-11 add_history_type_#res := 1; 105162#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 104913#L263 assume !(0 == init_~tmp___1~1);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; 104914#L116-14 assume !!(add_history_type_~var~0 < 3); 105211#L117-6 assume !(0 == add_history_type_~history_id); 105212#L123-6 assume !(1 == add_history_type_~history_id); 105321#L129-6 assume !(2 == add_history_type_~history_id); 105060#L135-9 assume 3 == add_history_type_~history_id;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; 105061#L151-3 assume 3 == read_history_int8_~history_id; 105070#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 105071#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 105078#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 105056#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 105057#L116-14 assume !(add_history_type_~var~0 < 3); 105262#L116-15 add_history_type_#res := 1; 105160#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 105161#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 105107#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 105108#L558-2 assume !!(main_~i2~0 < 10);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;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; 105653#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 105650#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 105645#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 105646#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 106579#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; 106578#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; 106577#L409 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;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; 106576#L226-2 assume !(0 == write_history_bool_~history_id); 106574#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 106571#L578-17 assume 0 != ~gate2Failed~0 % 256; 106572#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 106573#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; 106570#L440 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;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; 106566#L226-4 assume !(0 == write_history_bool_~history_id); 106565#L231-4 assume !(1 == write_history_bool_~history_id); 106563#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 106561#L578-18 assume 0 != ~gate3Failed~0 % 256; 106562#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 106591#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; 106590#L471 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; 106588#L486 assume ~VALUE1~0 == ~VALUE2~0; 106586#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 106585#L578-19 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; 106584#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 106583#L578-20 ~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;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; 106511#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 106510#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 105292#L171-12 assume 0 == read_history_bool_~history_id; 105234#L172-12 assume !(0 == read_history_bool_~historyIndex); 105235#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 105836#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 105834#L307 assume !(0 == check_~tmp___3~0 % 256); 105827#L307-1 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; 105826#L151-7 assume 3 == read_history_int8_~history_id; 105825#L152-7 assume !(0 == read_history_int8_~historyIndex); 105824#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 105823#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 105822#L346 assume check_~tmp___10~0 > -2;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; 105210#L151-8 [2018-12-02 12:41:33,724 INFO L796 eck$LassoCheckResult]: Loop: 105210#L151-8 assume 3 == read_history_int8_~history_id; 105317#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 105842#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 105254#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 105209#L346-1 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; 105681#L151-9 assume 3 == read_history_int8_~history_id; 105682#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 105814#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 105677#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 105067#L366-1 check_#res := 1; 105047#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 105048#L583-72 assume !(0 == assert_~arg % 256); 105231#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 105250#L558-2 assume !!(main_~i2~0 < 10);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;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; 105095#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 105096#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 105297#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 105641#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 105283#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; 105284#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; 105215#L409 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;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; 105088#L226-2 assume !(0 == write_history_bool_~history_id); 105089#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 105116#L578-17 assume 0 != ~gate2Failed~0 % 256; 105036#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 104978#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; 104979#L440 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;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; 106630#L226-4 assume !(0 == write_history_bool_~history_id); 106629#L231-4 assume !(1 == write_history_bool_~history_id); 106628#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 106626#L578-18 assume 0 != ~gate3Failed~0 % 256; 106627#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 106675#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; 106674#L471 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; 106673#L486 assume ~VALUE1~0 == ~VALUE2~0; 106664#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 106474#L578-19 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; 106718#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 106717#L578-20 ~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;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; 106712#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 106706#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 106704#L171-12 assume 0 == read_history_bool_~history_id; 106705#L172-12 assume !(0 == read_history_bool_~historyIndex); 106699#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 106698#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 106697#L307 assume !(0 == check_~tmp___3~0 % 256); 104937#L307-1 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; 104945#L151-7 assume 3 == read_history_int8_~history_id; 104993#L152-7 assume !(0 == read_history_int8_~historyIndex); 104994#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 105700#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 105208#L346 assume check_~tmp___10~0 > -2;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; 105210#L151-8 [2018-12-02 12:41:33,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1660168852, now seen corresponding path program 2 times [2018-12-02 12:41:33,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:33,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:33,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:33,799 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:33,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:41:33,799 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 187 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:41:33,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:41:33,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:41:33,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:41:33,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:33,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:33,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:41:33,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2018-12-02 12:41:33,882 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:41:33,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 987669882, now seen corresponding path program 1 times [2018-12-02 12:41:33,882 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:33,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:33,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:41:33,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:33,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:33,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:41:33,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 12:41:33,898 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:41:33,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 12:41:33,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 12:41:33,899 INFO L87 Difference]: Start difference. First operand 1828 states and 2436 transitions. cyclomatic complexity: 616 Second operand 7 states. [2018-12-02 12:41:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:41:34,177 INFO L93 Difference]: Finished difference Result 6769 states and 9093 transitions. [2018-12-02 12:41:34,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 12:41:34,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6769 states and 9093 transitions. [2018-12-02 12:41:34,187 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3051 [2018-12-02 12:41:34,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6769 states to 6769 states and 9093 transitions. [2018-12-02 12:41:34,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4921 [2018-12-02 12:41:34,194 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4921 [2018-12-02 12:41:34,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6769 states and 9093 transitions. [2018-12-02 12:41:34,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:34,195 INFO L705 BuchiCegarLoop]: Abstraction has 6769 states and 9093 transitions. [2018-12-02 12:41:34,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6769 states and 9093 transitions. [2018-12-02 12:41:34,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6769 to 1832. [2018-12-02 12:41:34,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1832 states. [2018-12-02 12:41:34,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1832 states to 1832 states and 2442 transitions. [2018-12-02 12:41:34,212 INFO L728 BuchiCegarLoop]: Abstraction has 1832 states and 2442 transitions. [2018-12-02 12:41:34,212 INFO L608 BuchiCegarLoop]: Abstraction has 1832 states and 2442 transitions. [2018-12-02 12:41:34,212 INFO L442 BuchiCegarLoop]: ======== Iteration 31============ [2018-12-02 12:41:34,213 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1832 states and 2442 transitions. [2018-12-02 12:41:34,214 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 571 [2018-12-02 12:41:34,214 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:41:34,214 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:41:34,215 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:41:34,215 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-12-02 12:41:34,215 INFO L794 eck$LassoCheckResult]: Stem: 114070#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 113845#L-1 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;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;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; 113846#L116-2 assume !!(add_history_type_~var~0 < 3); 114159#L117 assume 0 == add_history_type_~history_id;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; 114005#L171 assume 0 == read_history_bool_~history_id; 114006#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 113820#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 113995#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 113996#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 114193#L116-2 assume !(add_history_type_~var~0 < 3); 114191#L116-3 add_history_type_#res := 1; 114022#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 114023#L255 assume !(0 == init_~tmp~1);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; 114142#L116-6 assume !!(add_history_type_~var~0 < 3); 114138#L117-2 assume !(0 == add_history_type_~history_id); 114139#L123-2 assume 1 == add_history_type_~history_id;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; 114192#L171-4 assume !(0 == read_history_bool_~history_id); 114082#L181-4 assume 1 == read_history_bool_~history_id; 114083#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 113982#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 113880#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 113881#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 114209#L116-6 assume !(add_history_type_~var~0 < 3); 114205#L116-7 add_history_type_#res := 1; 114078#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 114014#L259 assume !(0 == init_~tmp___0~1);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; 114015#L116-10 assume !!(add_history_type_~var~0 < 3); 114133#L117-4 assume !(0 == add_history_type_~history_id); 114135#L123-4 assume !(1 == add_history_type_~history_id); 114245#L129-4 assume 2 == add_history_type_~history_id;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; 114206#L171-8 assume !(0 == read_history_bool_~history_id); 114098#L181-8 assume !(1 == read_history_bool_~history_id); 113890#L191-8 assume 2 == read_history_bool_~history_id; 113891#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 114100#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 113857#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 113858#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 114201#L116-10 assume !(add_history_type_~var~0 < 3); 114178#L116-11 add_history_type_#res := 1; 114073#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 113829#L263 assume !(0 == init_~tmp___1~1);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; 113830#L116-14 assume !!(add_history_type_~var~0 < 3); 114121#L117-6 assume !(0 == add_history_type_~history_id); 114123#L123-6 assume !(1 == add_history_type_~history_id); 114229#L129-6 assume !(2 == add_history_type_~history_id); 113973#L135-9 assume 3 == add_history_type_~history_id;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; 113974#L151-3 assume 3 == read_history_int8_~history_id; 113983#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 113984#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 113991#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 113969#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 113970#L116-14 assume !(add_history_type_~var~0 < 3); 114170#L116-15 add_history_type_#res := 1; 114071#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 114072#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 114020#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 114021#L558-2 assume !!(main_~i2~0 < 10);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;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; 114546#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 114681#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 114679#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 114680#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 115097#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; 115093#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; 115091#L409 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;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; 115089#L226-2 assume !(0 == write_history_bool_~history_id); 115085#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 115081#L578-17 assume 0 != ~gate2Failed~0 % 256; 115079#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 115077#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; 115075#L440 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;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; 115073#L226-4 assume !(0 == write_history_bool_~history_id); 115070#L231-4 assume !(1 == write_history_bool_~history_id); 115068#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 115059#L578-18 assume 0 != ~gate3Failed~0 % 256; 115058#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 115056#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; 115055#L471 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; 115052#L486 assume ~VALUE1~0 == ~VALUE2~0; 115050#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 115039#L578-19 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; 114929#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 114921#L578-20 ~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;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; 114912#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 114907#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 114904#L171-12 assume 0 == read_history_bool_~history_id; 114892#L172-12 assume !(0 == read_history_bool_~historyIndex); 114881#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 114872#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 114865#L307 assume !(0 == check_~tmp___3~0 % 256); 114852#L307-1 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; 114851#L151-7 assume 3 == read_history_int8_~history_id; 114850#L152-7 assume !(0 == read_history_int8_~historyIndex); 114158#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 113914#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 113915#L346 assume !(check_~tmp___10~0 > -2); 114118#L346-1 [2018-12-02 12:41:34,215 INFO L796 eck$LassoCheckResult]: Loop: 114118#L346-1 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; 115057#L151-9 assume 3 == read_history_int8_~history_id; 114848#L152-9 assume !(0 == read_history_int8_~historyIndex); 114827#L155-9 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 114825#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 114824#L366 assume !(check_~tmp___11~0 != ~nomsg~0); 114820#L366-1 check_#res := 1; 114819#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 114818#L583-72 assume !(0 == assert_~arg % 256); 114817#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 114816#L558-2 assume !!(main_~i2~0 < 10);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;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; 114806#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 114803#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 114800#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 114801#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 115485#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; 115483#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; 115481#L409 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;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; 115479#L226-2 assume !(0 == write_history_bool_~history_id); 115475#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 115472#L578-17 assume 0 != ~gate2Failed~0 % 256; 115473#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 115542#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; 115541#L440 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;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; 115539#L226-4 assume !(0 == write_history_bool_~history_id); 115537#L231-4 assume !(1 == write_history_bool_~history_id); 115535#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 115531#L578-18 assume 0 != ~gate3Failed~0 % 256; 115529#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 115526#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; 115524#L471 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; 115522#L486 assume ~VALUE1~0 == ~VALUE2~0; 115523#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 114978#L578-19 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; 115281#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 115280#L578-20 ~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;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; 115243#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 115240#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 115233#L171-12 assume 0 == read_history_bool_~history_id; 115234#L172-12 assume !(0 == read_history_bool_~historyIndex); 115188#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 115187#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 115161#L307 assume !(0 == check_~tmp___3~0 % 256); 114840#L307-1 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; 114838#L151-7 assume 3 == read_history_int8_~history_id; 114837#L152-7 assume !(0 == read_history_int8_~historyIndex); 114835#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 114834#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 114832#L346 assume check_~tmp___10~0 > -2;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; 114119#L151-8 assume 3 == read_history_int8_~history_id; 113905#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 113906#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 115061#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 114118#L346-1 [2018-12-02 12:41:34,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1660168633, now seen corresponding path program 1 times [2018-12-02 12:41:34,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:34,216 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:34,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:34,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:34,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:41:34,238 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 188 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:41:34,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:34,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:34,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:34,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:41:34,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 12:41:34,309 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:41:34,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:34,310 INFO L82 PathProgramCache]: Analyzing trace with hash -124363409, now seen corresponding path program 1 times [2018-12-02 12:41:34,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:34,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:41:34,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:41:34,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 12:41:34,316 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 12:41:34,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 12:41:34,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 12:41:34,317 INFO L87 Difference]: Start difference. First operand 1832 states and 2442 transitions. cyclomatic complexity: 618 Second operand 3 states. [2018-12-02 12:41:34,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:41:34,335 INFO L93 Difference]: Finished difference Result 1790 states and 2300 transitions. [2018-12-02 12:41:34,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 12:41:34,335 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1790 states and 2300 transitions. [2018-12-02 12:41:34,337 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 547 [2018-12-02 12:41:34,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1790 states to 1790 states and 2300 transitions. [2018-12-02 12:41:34,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1166 [2018-12-02 12:41:34,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1166 [2018-12-02 12:41:34,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1790 states and 2300 transitions. [2018-12-02 12:41:34,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:41:34,339 INFO L705 BuchiCegarLoop]: Abstraction has 1790 states and 2300 transitions. [2018-12-02 12:41:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1790 states and 2300 transitions. [2018-12-02 12:41:34,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1790 to 1780. [2018-12-02 12:41:34,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1780 states. [2018-12-02 12:41:34,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2290 transitions. [2018-12-02 12:41:34,346 INFO L728 BuchiCegarLoop]: Abstraction has 1780 states and 2290 transitions. [2018-12-02 12:41:34,346 INFO L608 BuchiCegarLoop]: Abstraction has 1780 states and 2290 transitions. [2018-12-02 12:41:34,346 INFO L442 BuchiCegarLoop]: ======== Iteration 32============ [2018-12-02 12:41:34,346 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1780 states and 2290 transitions. [2018-12-02 12:41:34,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 545 [2018-12-02 12:41:34,348 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:41:34,348 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:41:34,349 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-02 12:41:34,349 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-12-02 12:41:34,349 INFO L794 eck$LassoCheckResult]: Stem: 117963#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 117758#L-1 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;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;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; 117759#L116-2 assume !!(add_history_type_~var~0 < 3); 118047#L117 assume 0 == add_history_type_~history_id;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; 117901#L171 assume 0 == read_history_bool_~history_id; 117902#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 117733#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 117891#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 117892#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 118075#L116-2 assume !(add_history_type_~var~0 < 3); 118073#L116-3 add_history_type_#res := 1; 117918#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 117919#L255 assume !(0 == init_~tmp~1);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; 118033#L116-6 assume !!(add_history_type_~var~0 < 3); 118029#L117-2 assume !(0 == add_history_type_~history_id); 118030#L123-2 assume 1 == add_history_type_~history_id;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; 118074#L171-4 assume !(0 == read_history_bool_~history_id); 117975#L181-4 assume 1 == read_history_bool_~history_id; 117976#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 117880#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 117792#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 117793#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 118092#L116-6 assume !(add_history_type_~var~0 < 3); 118087#L116-7 add_history_type_#res := 1; 117971#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 117910#L259 assume !(0 == init_~tmp___0~1);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; 117911#L116-10 assume !!(add_history_type_~var~0 < 3); 118024#L117-4 assume !(0 == add_history_type_~history_id); 118025#L123-4 assume !(1 == add_history_type_~history_id); 118110#L129-4 assume 2 == add_history_type_~history_id;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; 118088#L171-8 assume !(0 == read_history_bool_~history_id); 117989#L181-8 assume !(1 == read_history_bool_~history_id); 117802#L191-8 assume 2 == read_history_bool_~history_id; 117803#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 117991#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 117770#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 117771#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 118082#L116-10 assume !(add_history_type_~var~0 < 3); 118062#L116-11 add_history_type_#res := 1; 117966#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 117742#L263 assume !(0 == init_~tmp___1~1);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; 117743#L116-14 assume !!(add_history_type_~var~0 < 3); 118012#L117-6 assume !(0 == add_history_type_~history_id); 118013#L123-6 assume !(1 == add_history_type_~history_id); 118101#L129-6 assume !(2 == add_history_type_~history_id); 117871#L135-9 assume 3 == add_history_type_~history_id;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; 117872#L151-3 assume 3 == read_history_int8_~history_id; 117881#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 117882#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 117887#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 117867#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 117868#L116-14 assume !(add_history_type_~var~0 < 3); 118057#L116-15 add_history_type_#res := 1; 117964#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 117965#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 117916#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 117917#L558-2 assume !!(main_~i2~0 < 10);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;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; 118370#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 118796#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 118794#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 118795#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 119231#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; 119229#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; 119227#L409 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;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; 119226#L226-2 assume !(0 == write_history_bool_~history_id); 119220#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 119218#L578-17 assume 0 != ~gate2Failed~0 % 256; 117854#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 117855#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; 119241#L440 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;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; 119240#L226-4 assume !(0 == write_history_bool_~history_id); 119166#L231-4 assume !(1 == write_history_bool_~history_id); 119084#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 119082#L578-18 assume 0 != ~gate3Failed~0 % 256; 119083#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 119271#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; 119267#L471 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; 119262#L486 assume ~VALUE1~0 == ~VALUE2~0; 119256#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 119253#L578-19 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; 119243#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 119167#L578-20 ~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;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; 119038#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 119031#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 119026#L171-12 assume 0 == read_history_bool_~history_id; 119018#L172-12 assume !(0 == read_history_bool_~historyIndex); 119012#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 119005#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 117764#L307 assume !(0 == check_~tmp___3~0 % 256); 117766#L307-1 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; 117774#L151-7 assume 3 == read_history_int8_~history_id; 117819#L152-7 assume !(0 == read_history_int8_~historyIndex); 117820#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 117823#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 117824#L346 assume !(check_~tmp___10~0 > -2); 118010#L346-1 [2018-12-02 12:41:34,349 INFO L796 eck$LassoCheckResult]: Loop: 118010#L346-1 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; 118845#L151-9 assume 3 == read_history_int8_~history_id; 118843#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 118840#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 118839#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 118148#L151-10 assume 3 == read_history_int8_~history_id; 118838#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 118837#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 118008#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 117878#L366-1 check_#res := 1; 117862#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 117863#L583-72 assume !(0 == assert_~arg % 256); 118031#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 118048#L558-2 assume !!(main_~i2~0 < 10);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;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; 118367#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 118366#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 118332#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 118333#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 119233#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; 119232#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; 119230#L409 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;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; 119228#L226-2 assume !(0 == write_history_bool_~history_id); 119224#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 119222#L578-17 assume 0 != ~gate2Failed~0 % 256; 119219#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 119217#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; 119216#L440 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;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; 119212#L226-4 assume !(0 == write_history_bool_~history_id); 119210#L231-4 assume !(1 == write_history_bool_~history_id); 119208#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 119205#L578-18 assume 0 != ~gate3Failed~0 % 256; 119206#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 119311#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; 119309#L471 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; 119306#L486 assume ~VALUE1~0 == ~VALUE2~0; 119307#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 119255#L578-19 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; 119364#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 119363#L578-20 ~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;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; 119344#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 119342#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 119340#L171-12 assume 0 == read_history_bool_~history_id; 119338#L172-12 assume !(0 == read_history_bool_~historyIndex); 119335#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 119334#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 118903#L307 assume !(0 == check_~tmp___3~0 % 256); 118897#L307-1 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; 118098#L151-7 assume 3 == read_history_int8_~history_id; 118099#L152-7 assume !(0 == read_history_int8_~historyIndex); 118596#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 118592#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 118590#L346 assume check_~tmp___10~0 > -2;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; 118011#L151-8 assume 3 == read_history_int8_~history_id; 117816#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 117817#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 117818#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 118010#L346-1 [2018-12-02 12:41:34,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1660168633, now seen corresponding path program 2 times [2018-12-02 12:41:34,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:34,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:41:34,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:41:34,369 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:34,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:41:34,369 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 189 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:41:34,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 12:41:34,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 12:41:34,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 12:41:34,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:41:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-02 12:41:34,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:41:34,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-12-02 12:41:34,441 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:41:34,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:41:34,441 INFO L82 PathProgramCache]: Analyzing trace with hash 206067124, now seen corresponding path program 1 times [2018-12-02 12:41:34,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:41:34,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:41:34,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,442 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 12:41:34,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:41:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:41:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:41:35,132 WARN L180 SmtUtils]: Spent 672.00 ms on a formula simplification. DAG size of input: 285 DAG size of output: 248 [2018-12-02 12:41:36,733 WARN L180 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 189 DAG size of output: 170 [2018-12-02 12:41:36,734 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:41:36,734 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:41:36,734 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:41:36,734 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:41:36,735 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:41:36,735 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:36,735 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:41:36,735 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:41:36,735 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration32_Loop [2018-12-02 12:41:36,735 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:41:36,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,936 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:36,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-12-02 12:41:37,244 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-12-02 12:41:37,286 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 12:41:46,529 WARN L180 SmtUtils]: Spent 9.13 s on a formula simplification. DAG size of input: 260 DAG size of output: 156 [2018-12-02 12:41:46,554 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:41:46,554 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,559 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,559 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,563 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,563 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,577 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,577 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,579 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,579 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,593 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,594 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,596 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,596 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,610 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,611 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,613 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,613 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,629 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,629 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,644 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,644 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,646 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,646 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,662 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,662 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,676 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,676 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,678 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,678 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,692 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,693 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,694 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,694 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,709 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,709 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,711 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,711 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,725 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,740 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,740 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,744 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,758 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,758 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,760 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,760 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,778 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,778 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,780 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,780 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,802 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,802 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:46,816 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:41:46,816 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,818 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:41:46,818 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:41:46,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:41:46,847 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:41:58,889 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 12:41:58,894 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:41:58,894 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:41:58,894 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:41:58,894 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:41:58,894 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:41:58,894 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:41:58,894 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:41:58,894 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:41:58,894 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration32_Loop [2018-12-02 12:41:58,894 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:41:58,894 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:41:58,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-12-02 12:41:58,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:58,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:58,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-12-02 12:41:58,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-12-02 12:41:59,108 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 82 [2018-12-02 12:41:59,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,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-12-02 12:41:59,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-12-02 12:41:59,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:41:59,410 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2018-12-02 12:41:59,485 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 12:42:08,429 WARN L180 SmtUtils]: Spent 8.86 s on a formula simplification. DAG size of input: 260 DAG size of output: 156 [2018-12-02 12:42:08,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:42:08,474 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:42:08,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-12-02 12:42:08,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,475 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,476 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,477 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,478 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,479 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,481 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:08,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:08,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,484 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,485 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,487 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,488 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,488 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,489 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,489 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,490 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,490 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,491 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,492 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,494 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,494 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,497 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,497 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,498 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,499 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,499 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,499 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,502 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:08,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:08,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,504 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:08,504 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:08,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,507 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:08,507 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:08,507 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,508 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,508 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:08,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:08,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,510 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,512 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,512 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,513 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,513 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,514 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,515 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,516 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,516 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,517 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,518 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,518 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,518 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,518 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:08,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,519 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,519 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:08,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-12-02 12:42:08,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:08,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:08,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:08,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:08,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:08,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:08,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:08,600 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:42:08,601 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:42:08,601 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:42:08,601 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:42:08,601 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:42:08,601 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:42:08,601 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-12-02 12:42:08,601 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:42:08,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:08,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:08,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:08,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:08,692 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-12-02 12:42:08,692 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1780 states and 2290 transitions. cyclomatic complexity: 518 Second operand 5 states. [2018-12-02 12:42:08,715 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1780 states and 2290 transitions. cyclomatic complexity: 518. Second operand 5 states. Result 4568 states and 5846 transitions. Complement of second has 6 states. [2018-12-02 12:42:08,715 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-12-02 12:42:08,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 12:42:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2018-12-02 12:42:08,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 461 transitions. Stem has 95 letters. Loop has 56 letters. [2018-12-02 12:42:08,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:42:08,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 461 transitions. Stem has 151 letters. Loop has 56 letters. [2018-12-02 12:42:08,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:42:08,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 461 transitions. Stem has 95 letters. Loop has 112 letters. [2018-12-02 12:42:08,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:42:08,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4568 states and 5846 transitions. [2018-12-02 12:42:08,744 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 545 [2018-12-02 12:42:08,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4568 states to 1045 states and 1331 transitions. [2018-12-02 12:42:08,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 998 [2018-12-02 12:42:08,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 998 [2018-12-02 12:42:08,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1045 states and 1331 transitions. [2018-12-02 12:42:08,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:42:08,746 INFO L705 BuchiCegarLoop]: Abstraction has 1045 states and 1331 transitions. [2018-12-02 12:42:08,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1045 states and 1331 transitions. [2018-12-02 12:42:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1045 to 430. [2018-12-02 12:42:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-12-02 12:42:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 546 transitions. [2018-12-02 12:42:08,749 INFO L728 BuchiCegarLoop]: Abstraction has 430 states and 546 transitions. [2018-12-02 12:42:08,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:42:08,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:42:08,749 INFO L87 Difference]: Start difference. First operand 430 states and 546 transitions. Second operand 5 states. [2018-12-02 12:42:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:08,770 INFO L93 Difference]: Finished difference Result 556 states and 700 transitions. [2018-12-02 12:42:08,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 12:42:08,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 556 states and 700 transitions. [2018-12-02 12:42:08,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2018-12-02 12:42:08,771 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 556 states to 536 states and 678 transitions. [2018-12-02 12:42:08,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 401 [2018-12-02 12:42:08,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 401 [2018-12-02 12:42:08,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 536 states and 678 transitions. [2018-12-02 12:42:08,772 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:42:08,772 INFO L705 BuchiCegarLoop]: Abstraction has 536 states and 678 transitions. [2018-12-02 12:42:08,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states and 678 transitions. [2018-12-02 12:42:08,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 455. [2018-12-02 12:42:08,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-12-02 12:42:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 579 transitions. [2018-12-02 12:42:08,869 INFO L728 BuchiCegarLoop]: Abstraction has 455 states and 579 transitions. [2018-12-02 12:42:08,869 INFO L608 BuchiCegarLoop]: Abstraction has 455 states and 579 transitions. [2018-12-02 12:42:08,869 INFO L442 BuchiCegarLoop]: ======== Iteration 33============ [2018-12-02 12:42:08,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 455 states and 579 transitions. [2018-12-02 12:42:08,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2018-12-02 12:42:08,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:42:08,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:42:08,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-12-02 12:42:08,871 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-12-02 12:42:08,871 INFO L794 eck$LassoCheckResult]: Stem: 125980#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 125843#L-1 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;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;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; 125844#L116-2 assume !!(add_history_type_~var~0 < 3); 126056#L117 assume 0 == add_history_type_~history_id;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; 126103#L171 assume 0 == read_history_bool_~history_id; 126100#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 126097#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 126096#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 126071#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 126057#L116-2 assume !!(add_history_type_~var~0 < 3); 126036#L117 assume 0 == add_history_type_~history_id;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; 125940#L171 assume 0 == read_history_bool_~history_id; 125941#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 125827#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 125934#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 125935#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 126090#L116-2 assume !(add_history_type_~var~0 < 3); 126054#L116-3 add_history_type_#res := 1; 125953#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 125954#L255 assume !(0 == init_~tmp~1);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; 126030#L116-6 assume !!(add_history_type_~var~0 < 3); 126068#L117-2 assume !(0 == add_history_type_~history_id); 126269#L123-2 assume 1 == add_history_type_~history_id;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; 126268#L171-4 assume !(0 == read_history_bool_~history_id); 126266#L181-4 assume 1 == read_history_bool_~history_id; 126264#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 126258#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 126256#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 126073#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 126069#L116-6 assume !!(add_history_type_~var~0 < 3); 126027#L117-2 assume !(0 == add_history_type_~history_id); 126028#L123-2 assume 1 == add_history_type_~history_id;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; 126055#L171-4 assume !(0 == read_history_bool_~history_id); 125989#L181-4 assume 1 == read_history_bool_~history_id; 125990#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 125924#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 125865#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 125866#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 126091#L116-6 assume !(add_history_type_~var~0 < 3); 126065#L116-7 add_history_type_#res := 1; 125986#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 125946#L259 assume !(0 == init_~tmp___0~1);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; 125947#L116-10 assume !!(add_history_type_~var~0 < 3); 126022#L117-4 assume !(0 == add_history_type_~history_id); 126023#L123-4 assume !(1 == add_history_type_~history_id); 126081#L129-4 assume 2 == add_history_type_~history_id;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; 126067#L171-8 assume !(0 == read_history_bool_~history_id); 125999#L181-8 assume !(1 == read_history_bool_~history_id); 125874#L191-8 assume 2 == read_history_bool_~history_id; 125875#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 126002#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 125852#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 125853#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 126062#L116-10 assume !!(add_history_type_~var~0 < 3); 126024#L117-4 assume !(0 == add_history_type_~history_id); 126025#L123-4 assume !(1 == add_history_type_~history_id); 126080#L129-4 assume 2 == add_history_type_~history_id;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; 126066#L171-8 assume !(0 == read_history_bool_~history_id); 125998#L181-8 assume !(1 == read_history_bool_~history_id); 125872#L191-8 assume 2 == read_history_bool_~history_id; 125873#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 126000#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 125850#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 125851#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 126061#L116-10 assume !(add_history_type_~var~0 < 3); 126046#L116-11 add_history_type_#res := 1; 125983#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 125834#L263 assume !(0 == init_~tmp___1~1);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; 125835#L116-14 assume !!(add_history_type_~var~0 < 3); 126014#L117-6 assume !(0 == add_history_type_~history_id); 126015#L123-6 assume !(1 == add_history_type_~history_id); 126076#L129-6 assume !(2 == add_history_type_~history_id); 125919#L135-9 assume 3 == add_history_type_~history_id;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; 125920#L151-3 assume 3 == read_history_int8_~history_id; 125927#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 125928#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 125932#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 125915#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 125916#L116-14 assume !!(add_history_type_~var~0 < 3); 126016#L117-6 assume !(0 == add_history_type_~history_id); 126017#L123-6 assume !(1 == add_history_type_~history_id); 126075#L129-6 assume !(2 == add_history_type_~history_id); 125917#L135-9 assume 3 == add_history_type_~history_id;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; 125918#L151-3 assume 3 == read_history_int8_~history_id; 125925#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 125926#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 125931#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 125913#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 125914#L116-14 assume !(add_history_type_~var~0 < 3); 126042#L116-15 add_history_type_#res := 1; 125981#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 125982#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 125950#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 125951#L558-2 assume !!(main_~i2~0 < 10);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;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; 126241#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 126240#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 126237#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 125948#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 125949#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; 126053#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; 126018#L409 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;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; 125938#L226-2 assume !(0 == write_history_bool_~history_id); 125939#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 125958#L578-17 assume 0 != ~gate2Failed~0 % 256; 126064#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 126223#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; 126221#L440 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;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; 126219#L226-4 assume !(0 == write_history_bool_~history_id); 126217#L231-4 assume !(1 == write_history_bool_~history_id); 126215#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 126212#L578-18 assume 0 != ~gate3Failed~0 % 256; 126213#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 126252#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; 126072#L471 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; 126032#L486 assume ~VALUE1~0 == ~VALUE2~0; 126034#L487 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE3~0; 125859#L578-19 [2018-12-02 12:42:09,606 INFO L796 eck$LassoCheckResult]: Loop: 125859#L578-19 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; 126239#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 126236#L578-20 ~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;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; 126139#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 126137#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 126134#L171-12 assume 0 == read_history_bool_~history_id; 126031#L172-12 assume !(0 == read_history_bool_~historyIndex); 126010#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 126011#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 126131#L307 assume !(0 == check_~tmp___3~0 % 256); 125849#L307-1 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; 125854#L151-7 assume 3 == read_history_int8_~history_id; 125884#L152-7 assume !(0 == read_history_int8_~historyIndex); 125885#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 125886#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 125887#L346 assume check_~tmp___10~0 > -2;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; 126013#L151-8 assume 3 == read_history_int8_~history_id; 125881#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 125882#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 125883#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 126004#L346-1 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; 126005#L151-9 assume 3 == read_history_int8_~history_id; 125878#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 125879#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 125880#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 126074#L151-10 assume 3 == read_history_int8_~history_id; 125908#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 125909#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 125910#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 125922#L366-1 check_#res := 1; 125911#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 125912#L583-72 assume !(0 == assert_~arg % 256); 126029#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 126037#L558-2 assume !!(main_~i2~0 < 10);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;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; 125943#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 125944#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 125992#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 125993#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 126234#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; 126233#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; 126232#L409 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;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; 126231#L226-2 assume !(0 == write_history_bool_~history_id); 126229#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 126228#L578-17 assume 0 != ~gate2Failed~0 % 256; 125904#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 125876#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; 125877#L440 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;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; 125988#L226-4 assume !(0 == write_history_bool_~history_id); 125984#L231-4 assume !(1 == write_history_bool_~history_id); 125985#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 125995#L578-18 assume 0 != ~gate3Failed~0 % 256; 126035#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 126020#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; 126021#L471 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; 126247#L486 assume !(~VALUE1~0 == ~VALUE2~0); 126245#L493 assume ~VALUE1~0 == ~VALUE3~0; 126244#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 125859#L578-19 [2018-12-02 12:42:09,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:09,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1190395073, now seen corresponding path program 1 times [2018-12-02 12:42:09,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:09,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:09,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 12:42:10,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 12:42:10,001 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 207 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 12:42:10,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:10,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-02 12:42:10,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 12:42:10,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-12-02 12:42:10,181 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:42:10,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:10,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1866262745, now seen corresponding path program 1 times [2018-12-02 12:42:10,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:10,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:10,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:10,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:10,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:42:10,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:42:10,880 WARN L180 SmtUtils]: Spent 679.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 248 [2018-12-02 12:42:11,826 WARN L180 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-12-02 12:42:11,828 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:42:11,828 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:42:11,828 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:42:11,828 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:42:11,828 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:42:11,828 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:11,828 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:42:11,828 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:42:11,828 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration33_Loop [2018-12-02 12:42:11,828 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:42:11,828 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:42:11,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,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-12-02 12:42:11,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:11,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:12,032 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,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-12-02 12:42:12,395 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-02 12:42:12,405 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 12:42:16,680 WARN L180 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-12-02 12:42:16,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:42:16,691 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,695 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,695 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,698 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,698 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,713 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,713 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,715 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,715 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,729 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,729 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,730 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,731 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,745 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,745 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,747 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,747 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,761 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,761 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,763 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,763 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,777 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,777 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,779 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,794 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,794 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,795 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,795 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,810 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,824 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,824 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,831 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,832 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,853 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,853 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,855 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,855 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,872 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,872 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,886 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,888 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,888 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,902 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,904 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,920 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,920 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,934 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,934 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,936 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,936 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,952 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,966 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,966 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,969 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:16,990 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:16,990 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:16,992 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:16,992 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:17,006 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,006 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,008 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,008 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:17,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,024 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:17,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,040 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,040 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:17,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,056 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/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-12-02 12:42:17,071 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,071 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,072 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,072 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 231 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 231 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,088 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,088 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 232 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 232 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,104 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 233 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 233 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,119 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,119 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,121 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,121 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 234 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 234 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,137 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,137 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 235 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 235 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,151 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,151 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,153 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,153 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 236 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 236 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,167 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,167 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:17,169 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:17,169 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 237 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 237 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:17,184 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 238 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 238 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:17,214 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:42:17,214 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:29,263 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 12:42:29,268 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:42:29,268 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:42:29,268 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:42:29,268 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:42:29,268 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:42:29,268 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:29,268 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:42:29,269 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:42:29,269 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration33_Loop [2018-12-02 12:42:29,269 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:42:29,269 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,284 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:29,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:29,401 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:29,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:29,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:29,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-12-02 12:42:29,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,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-12-02 12:42:29,634 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-02 12:42:29,857 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 12:42:34,025 WARN L180 SmtUtils]: Spent 4.15 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-12-02 12:42:34,140 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:42:34,140 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:42:34,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-12-02 12:42:34,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,141 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,141 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,142 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,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-12-02 12:42:34,145 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,145 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,145 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,147 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,147 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,148 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,148 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,149 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,150 INFO L206 nArgumentSynthesizer]: 12 loop disjuncts [2018-12-02 12:42:34,150 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,157 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-12-02 12:42:34,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,208 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,209 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,210 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,211 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,211 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,211 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,212 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,212 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,212 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,214 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,216 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,216 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,217 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,217 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,217 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,218 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,218 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,218 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,218 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,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-12-02 12:42:34,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,219 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,219 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,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-12-02 12:42:34,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,221 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,222 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,222 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,223 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,223 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,223 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,224 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,224 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,225 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,227 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,229 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,230 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,232 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,232 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,232 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,234 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,236 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,236 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,240 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,241 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:42:34,241 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:42:34,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,246 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:42:34,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:42:34,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:42:34,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:42:34,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:42:34,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:42:34,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:42:34,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:42:34,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:42:34,286 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:42:34,287 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:42:34,287 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:42:34,287 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:42:34,287 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:42:34,287 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:42:34,287 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-12-02 12:42:34,287 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:42:34,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:34,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:34,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:42:34,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:42:34,409 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-12-02 12:42:34,409 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 455 states and 579 transitions. cyclomatic complexity: 129 Second operand 5 states. [2018-12-02 12:42:34,432 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 455 states and 579 transitions. cyclomatic complexity: 129. Second operand 5 states. Result 1017 states and 1295 transitions. Complement of second has 6 states. [2018-12-02 12:42:34,432 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-12-02 12:42:34,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 12:42:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2018-12-02 12:42:34,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 459 transitions. Stem has 116 letters. Loop has 57 letters. [2018-12-02 12:42:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:42:34,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 459 transitions. Stem has 173 letters. Loop has 57 letters. [2018-12-02 12:42:34,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:42:34,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 459 transitions. Stem has 116 letters. Loop has 114 letters. [2018-12-02 12:42:34,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:42:34,434 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1017 states and 1295 transitions. [2018-12-02 12:42:34,435 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 269 [2018-12-02 12:42:34,436 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1017 states to 447 states and 563 transitions. [2018-12-02 12:42:34,436 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-12-02 12:42:34,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-12-02 12:42:34,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 447 states and 563 transitions. [2018-12-02 12:42:34,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:42:34,439 INFO L705 BuchiCegarLoop]: Abstraction has 447 states and 563 transitions. [2018-12-02 12:42:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states and 563 transitions. [2018-12-02 12:42:34,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-12-02 12:42:34,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-12-02 12:42:34,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 563 transitions. [2018-12-02 12:42:34,441 INFO L728 BuchiCegarLoop]: Abstraction has 447 states and 563 transitions. [2018-12-02 12:42:34,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 12:42:34,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 12:42:34,441 INFO L87 Difference]: Start difference. First operand 447 states and 563 transitions. Second operand 6 states. [2018-12-02 12:42:34,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:42:34,478 INFO L93 Difference]: Finished difference Result 534 states and 666 transitions. [2018-12-02 12:42:34,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 12:42:34,478 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 534 states and 666 transitions. [2018-12-02 12:42:34,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 269 [2018-12-02 12:42:34,480 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 534 states to 514 states and 644 transitions. [2018-12-02 12:42:34,480 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2018-12-02 12:42:34,480 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2018-12-02 12:42:34,480 INFO L73 IsDeterministic]: Start isDeterministic. Operand 514 states and 644 transitions. [2018-12-02 12:42:34,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 12:42:34,480 INFO L705 BuchiCegarLoop]: Abstraction has 514 states and 644 transitions. [2018-12-02 12:42:34,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states and 644 transitions. [2018-12-02 12:42:34,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 494. [2018-12-02 12:42:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2018-12-02 12:42:34,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 622 transitions. [2018-12-02 12:42:34,482 INFO L728 BuchiCegarLoop]: Abstraction has 494 states and 622 transitions. [2018-12-02 12:42:34,482 INFO L608 BuchiCegarLoop]: Abstraction has 494 states and 622 transitions. [2018-12-02 12:42:34,482 INFO L442 BuchiCegarLoop]: ======== Iteration 34============ [2018-12-02 12:42:34,482 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 494 states and 622 transitions. [2018-12-02 12:42:34,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 269 [2018-12-02 12:42:34,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 12:42:34,483 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 12:42:34,601 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [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] [2018-12-02 12:42:34,601 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-12-02 12:42:34,601 INFO L794 eck$LassoCheckResult]: Stem: 129324#ULTIMATE.startENTRY ~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;~gate1Failed~0 := 0;~gate2Failed~0 := 0;~gate3Failed~0 := 0;~VALUE1~0 := 0;~VALUE2~0 := 0;~VALUE3~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;~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]; 129186#L-1 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;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;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; 129187#L116-2 assume !!(add_history_type_~var~0 < 3); 129398#L117 assume 0 == add_history_type_~history_id;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; 129284#L171 assume 0 == read_history_bool_~history_id; 129285#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 129170#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 129278#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 129279#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129399#L116-2 assume !!(add_history_type_~var~0 < 3); 129377#L117 assume 0 == add_history_type_~history_id;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; 129378#L171 assume 0 == read_history_bool_~history_id; 129637#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 129633#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 129631#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 129629#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129626#L116-2 assume !!(add_history_type_~var~0 < 3); 129435#L117 assume 0 == add_history_type_~history_id;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; 129623#L171 assume 0 == read_history_bool_~history_id; 129620#L172 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_0~0; 129617#L203 add_history_type_#t~ret0 := read_history_bool_#res;add_history_type_~tmp~0 := add_history_type_#t~ret0 % 256;havoc add_history_type_#t~ret0; 129616#L119 assume !!(add_history_type_~tmp~0 == add_history_type_~ini_bool~0 % 256); 129438#L135-2 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129434#L116-2 assume !(add_history_type_~var~0 < 3); 129396#L116-3 add_history_type_#res := 1; 129296#L143 init_#t~ret5 := add_history_type_#res;init_~tmp~1 := init_#t~ret5;havoc init_#t~ret5; 129297#L255 assume !(0 == init_~tmp~1);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; 129372#L116-6 assume !!(add_history_type_~var~0 < 3); 129369#L117-2 assume !(0 == add_history_type_~history_id); 129370#L123-2 assume 1 == add_history_type_~history_id;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; 129433#L171-4 assume !(0 == read_history_bool_~history_id); 129487#L181-4 assume 1 == read_history_bool_~history_id; 129521#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 129477#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 129476#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 129415#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129410#L116-6 assume !!(add_history_type_~var~0 < 3); 129411#L117-2 assume !(0 == add_history_type_~history_id); 129596#L123-2 assume 1 == add_history_type_~history_id;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; 129595#L171-4 assume !(0 == read_history_bool_~history_id); 129485#L181-4 assume 1 == read_history_bool_~history_id; 129481#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 129479#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 129512#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 129510#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129508#L116-6 assume !!(add_history_type_~var~0 < 3); 129437#L117-2 assume !(0 == add_history_type_~history_id); 129503#L123-2 assume 1 == add_history_type_~history_id;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; 129397#L171-4 assume !(0 == read_history_bool_~history_id); 129333#L181-4 assume 1 == read_history_bool_~history_id; 129334#L182-4 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate2Failed_History_0~0; 129268#L203-4 add_history_type_#t~ret1 := read_history_bool_#res;add_history_type_~tmp___0~0 := add_history_type_#t~ret1 % 256;havoc add_history_type_#t~ret1; 129210#L125-1 assume !!(add_history_type_~tmp___0~0 == add_history_type_~ini_bool~0 % 256); 129211#L135-5 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129436#L116-6 assume !(add_history_type_~var~0 < 3); 129405#L116-7 add_history_type_#res := 1; 129330#L143-1 init_#t~ret6 := add_history_type_#res;init_~tmp___0~1 := init_#t~ret6;havoc init_#t~ret6; 129290#L259 assume !(0 == init_~tmp___0~1);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; 129291#L116-10 assume !!(add_history_type_~var~0 < 3); 129365#L117-4 assume !(0 == add_history_type_~history_id); 129366#L123-4 assume !(1 == add_history_type_~history_id); 129662#L129-4 assume 2 == add_history_type_~history_id;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; 129661#L171-8 assume !(0 == read_history_bool_~history_id); 129660#L181-8 assume !(1 == read_history_bool_~history_id); 129657#L191-8 assume 2 == read_history_bool_~history_id; 129655#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 129654#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 129653#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 129652#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129403#L116-10 assume !!(add_history_type_~var~0 < 3); 129367#L117-4 assume !(0 == add_history_type_~history_id); 129368#L123-4 assume !(1 == add_history_type_~history_id); 129423#L129-4 assume 2 == add_history_type_~history_id;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; 129409#L171-8 assume !(0 == read_history_bool_~history_id); 129343#L181-8 assume !(1 == read_history_bool_~history_id); 129217#L191-8 assume 2 == read_history_bool_~history_id; 129218#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 129346#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 129195#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 129196#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129414#L116-10 assume !!(add_history_type_~var~0 < 3); 129446#L117-4 assume !(0 == add_history_type_~history_id); 129432#L123-4 assume !(1 == add_history_type_~history_id); 129422#L129-4 assume 2 == add_history_type_~history_id;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; 129408#L171-8 assume !(0 == read_history_bool_~history_id); 129342#L181-8 assume !(1 == read_history_bool_~history_id); 129215#L191-8 assume 2 == read_history_bool_~history_id; 129216#L192-8 assume 0 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate3Failed_History_0~0; 129344#L203-8 add_history_type_#t~ret2 := read_history_bool_#res;add_history_type_~tmp___1~0 := add_history_type_#t~ret2 % 256;havoc add_history_type_#t~ret2; 129193#L131-2 assume !!(add_history_type_~tmp___1~0 == add_history_type_~ini_bool~0 % 256); 129194#L135-8 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129402#L116-10 assume !(add_history_type_~var~0 < 3); 129391#L116-11 add_history_type_#res := 1; 129327#L143-2 init_#t~ret7 := add_history_type_#res;init_~tmp___1~1 := init_#t~ret7;havoc init_#t~ret7; 129177#L263 assume !(0 == init_~tmp___1~1);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; 129178#L116-14 assume !!(add_history_type_~var~0 < 3); 129357#L117-6 assume !(0 == add_history_type_~history_id); 129358#L123-6 assume !(1 == add_history_type_~history_id); 129467#L129-6 assume !(2 == add_history_type_~history_id); 129465#L135-9 assume 3 == add_history_type_~history_id;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; 129463#L151-3 assume 3 == read_history_int8_~history_id; 129461#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129459#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 129457#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 129455#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129386#L116-14 assume !!(add_history_type_~var~0 < 3); 129359#L117-6 assume !(0 == add_history_type_~history_id); 129360#L123-6 assume !(1 == add_history_type_~history_id); 129419#L129-6 assume !(2 == add_history_type_~history_id); 129263#L135-9 assume 3 == add_history_type_~history_id;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; 129264#L151-3 assume 3 == read_history_int8_~history_id; 129271#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129272#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 129276#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 129259#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129260#L116-14 assume !!(add_history_type_~var~0 < 3); 129443#L117-6 assume !(0 == add_history_type_~history_id); 129431#L123-6 assume !(1 == add_history_type_~history_id); 129418#L129-6 assume !(2 == add_history_type_~history_id); 129261#L135-9 assume 3 == add_history_type_~history_id;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; 129262#L151-3 assume 3 == read_history_int8_~history_id; 129269#L152-3 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129270#L163-3 add_history_type_#t~ret3 := read_history_int8_#res;add_history_type_~tmp___2~0 := add_history_type_#t~ret3;havoc add_history_type_#t~ret3; 129275#L137-3 assume !!(add_history_type_~tmp___2~0 == add_history_type_~ini_int~0); 129257#L135-11 add_history_type_#t~post4 := add_history_type_~var~0;add_history_type_~var~0 := 1 + add_history_type_#t~post4;havoc add_history_type_#t~post4; 129258#L116-14 assume !(add_history_type_~var~0 < 3); 129385#L116-15 add_history_type_#res := 1; 129325#L143-3 init_#t~ret8 := add_history_type_#res;init_~tmp___2~1 := init_#t~ret8;havoc init_#t~ret8; 129326#L267 assume !(0 == init_~tmp___2~1);init_#res := 1; 129294#L270 main_#t~ret57 := init_#res;main_~i2~0 := main_#t~ret57;havoc main_#t~ret57;assume 0 != main_~i2~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; 129295#L558-2 assume !!(main_~i2~0 < 10);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;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; 129287#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 129288#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 129336#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 129292#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 129293#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; 129395#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; 129361#L409 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;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; 129282#L226-2 assume !(0 == write_history_bool_~history_id); 129283#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 129301#L578-17 assume 0 != ~gate2Failed~0 % 256; 129248#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 129221#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; 129222#L440 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;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; 129598#L226-4 assume !(0 == write_history_bool_~history_id); 129597#L231-4 assume !(1 == write_history_bool_~history_id); 129338#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 129339#L578-18 assume 0 != ~gate3Failed~0 % 256; 129407#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 129659#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; 129658#L471 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; 129374#L486 assume !(~VALUE1~0 == ~VALUE2~0); 129375#L493 assume ~VALUE1~0 == ~VALUE3~0; 129201#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 129202#L578-19 [2018-12-02 12:42:35,522 INFO L796 eck$LassoCheckResult]: Loop: 129202#L578-19 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; 129600#L211 assume 3 == write_history_int8_~history_id;~votedValue_History_2~0 := ~votedValue_History_1~0;~votedValue_History_1~0 := ~votedValue_History_0~0;~votedValue_History_0~0 := write_history_int8_~buf; 129599#L578-20 ~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;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; 129498#L294 assume 0 == ~gate1Failed~0 % 256;check_~tmp~2 := 1; 129495#L300-2 assume 0 != (if 0 == check_~tmp~2 then 0 else 1) % 256;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; 129494#L171-12 assume 0 == read_history_bool_~history_id; 129493#L172-12 assume !(0 == read_history_bool_~historyIndex); 129492#L175-12 assume 1 == read_history_bool_~historyIndex;read_history_bool_#res := ~gate1Failed_History_1~0; 129491#L203-12 check_#t~ret9 := read_history_bool_#res;check_~tmp___3~0 := check_#t~ret9;havoc check_#t~ret9; 129489#L307 assume !(0 == check_~tmp___3~0 % 256); 129192#L307-1 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; 129197#L151-7 assume 3 == read_history_int8_~history_id; 129228#L152-7 assume !(0 == read_history_int8_~historyIndex); 129229#L155-7 assume 1 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_1~0; 129230#L163-7 check_#t~ret18 := read_history_int8_#res;check_~tmp___10~0 := check_#t~ret18;havoc check_#t~ret18; 129231#L346 assume check_~tmp___10~0 > -2;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; 129356#L151-8 assume 3 == read_history_int8_~history_id; 129225#L152-8 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129226#L163-8 check_#t~ret19 := read_history_int8_#res;check_~tmp___6~0 := check_#t~ret19;havoc check_#t~ret19; 129227#L348 assume !(check_~tmp___6~0 == ~nomsg~0); 129381#L346-1 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; 129426#L151-9 assume 3 == read_history_int8_~history_id; 129219#L152-9 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129220#L163-9 check_#t~ret23 := read_history_int8_#res;check_~tmp___11~0 := check_#t~ret23;havoc check_#t~ret23; 129416#L366 assume check_~tmp___11~0 != ~nomsg~0;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; 129417#L151-10 assume 3 == read_history_int8_~history_id; 129252#L152-10 assume 0 == read_history_int8_~historyIndex;read_history_int8_#res := ~votedValue_History_0~0; 129253#L163-10 check_#t~ret24 := read_history_int8_#res;check_~tmp___12~0 := check_#t~ret24;havoc check_#t~ret24; 129254#L368 assume !!(~VALUE1~0 == check_~tmp___12~0); 129266#L366-1 check_#res := 1; 129255#L378 main_#t~ret58 := check_#res;main_~c1~0 := main_#t~ret58;havoc main_#t~ret58;assert_#in~arg := (if 0 == main_~c1~0 then 0 else 1);havoc assert_~arg;assert_~arg := assert_#in~arg; 129256#L583-72 assume !(0 == assert_~arg % 256); 129371#L578-36 main_#t~post59 := main_~i2~0;main_~i2~0 := 1 + main_#t~post59;havoc main_#t~post59; 129379#L558-2 assume !!(main_~i2~0 < 10);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;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; 129580#L226 assume 0 == write_history_bool_~history_id;~gate1Failed_History_2~0 := ~gate1Failed_History_1~0;~gate1Failed_History_1~0 := ~gate1Failed_History_0~0;~gate1Failed_History_0~0 := write_history_bool_~buf; 129578#L578-16 assume !(0 != ~gate1Failed~0 % 256);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; 129574#L396 assume 0 == gate1_each_pals_period_~next_state~0;gate1_each_pals_period_~tmp___0~3 := 1; 129572#L402-2 assume 0 != (if 0 == gate1_each_pals_period_~tmp___0~3 then 0 else 1) % 256; 129570#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; 129568#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; 129567#L409 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;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; 129566#L226-2 assume !(0 == write_history_bool_~history_id); 129564#L231-2 assume 1 == write_history_bool_~history_id;~gate2Failed_History_2~0 := ~gate2Failed_History_1~0;~gate2Failed_History_1~0 := ~gate2Failed_History_0~0;~gate2Failed_History_0~0 := write_history_bool_~buf; 129560#L578-17 assume 0 != ~gate2Failed~0 % 256; 129558#L422 assume !(~nomsg~0 != ~nomsg~0 && ~g2v_new~0 == ~nomsg~0);gate2_each_pals_period_#t~ite32 := ~g2v_new~0; 129556#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; 129554#L440 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;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; 129552#L226-4 assume !(0 == write_history_bool_~history_id); 129550#L231-4 assume !(1 == write_history_bool_~history_id); 129548#L236-4 assume 2 == write_history_bool_~history_id;~gate3Failed_History_2~0 := ~gate3Failed_History_1~0;~gate3Failed_History_1~0 := ~gate3Failed_History_0~0;~gate3Failed_History_0~0 := write_history_bool_~buf; 129546#L578-18 assume 0 != ~gate3Failed~0 % 256; 129376#L453 assume !(~nomsg~0 != ~nomsg~0 && ~g3v_new~0 == ~nomsg~0);gate3_each_pals_period_#t~ite36 := ~g3v_new~0; 129363#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; 129364#L471 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; 129413#L486 assume !(~VALUE1~0 == ~VALUE2~0); 129645#L493 assume ~VALUE1~0 == ~VALUE3~0; 129643#L494 assume ~VALUE1~0 == ~nomsg~0;voter_~voted_value~0 := ~VALUE2~0; 129202#L578-19 [2018-12-02 12:42:35,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2010096550, now seen corresponding path program 1 times [2018-12-02 12:42:35,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:35,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:35,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:35,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:42:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-12-02 12:42:35,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 12:42:35,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 12:42:35,976 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 12:42:35,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:42:35,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1866262745, now seen corresponding path program 2 times [2018-12-02 12:42:36,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 12:42:36,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 12:42:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:36,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 12:42:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 12:42:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:42:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 12:42:36,763 WARN L180 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 248 [2018-12-02 12:42:37,743 WARN L180 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 171 [2018-12-02 12:42:37,745 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:42:37,745 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:42:37,745 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:42:37,745 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:42:37,745 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 12:42:37,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:37,746 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:42:37,746 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:42:37,746 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration34_Loop [2018-12-02 12:42:37,746 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:42:37,746 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:42:37,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-12-02 12:42:37,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,895 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:37,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-12-02 12:42:38,158 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-02 12:42:38,348 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 12:42:41,793 WARN L180 SmtUtils]: Spent 3.43 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-12-02 12:42:41,899 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:42:41,899 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 239 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 239 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:41,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:41,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:41,907 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:41,907 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 240 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 240 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:41,921 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:41,921 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:41,923 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:41,923 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 241 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 241 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:41,937 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:41,937 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:41,939 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:41,939 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 242 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 242 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:41,953 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:41,954 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:41,956 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:41,956 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 243 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 243 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:41,970 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:41,970 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:41,972 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:41,972 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 244 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 244 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:41,986 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:41,986 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:41,988 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:41,988 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 245 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 245 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,004 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 246 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 246 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,022 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,022 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,036 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,036 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 247 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 247 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,038 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,040 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,040 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 248 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 248 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,056 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,056 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 249 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 249 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,070 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,072 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,072 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 250 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 250 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,086 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,086 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,088 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,088 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 251 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 251 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,102 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,102 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,104 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,104 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 252 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 252 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,118 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,118 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,120 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,120 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 253 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 253 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,134 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,134 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,136 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,136 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 254 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 254 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,150 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,150 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,152 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,152 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 255 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 255 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,166 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,166 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,168 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,168 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 256 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 256 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,182 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,182 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:42,184 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 12:42:42,184 INFO L448 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_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 257 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 257 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,198 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 12:42:42,198 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6a951cc7-f079-494d-bd35-3e9f554fb6b3/bin-2019/uautomizer/z3 Starting monitored process 258 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 258 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:42,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 12:42:42,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 12:42:54,874 INFO L450 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2018-12-02 12:42:54,899 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 12:42:54,899 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 12:42:54,899 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 12:42:54,899 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 12:42:54,899 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 12:42:54,899 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 12:42:54,899 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 12:42:54,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 12:42:54,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: pals_STARTPALS_Triplicated_true-unreach-call.ufo.BOUNDED-10.pals_true-termination.c_Iteration34_Loop [2018-12-02 12:42:54,900 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 12:42:54,900 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:54,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:54,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:54,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:54,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-12-02 12:42:55,072 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-12-02 12:42:55,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,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-12-02 12:42:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,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-12-02 12:42:55,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-12-02 12:42:55,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,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-12-02 12:42:55,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-12-02 12:42:55,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-12-02 12:42:55,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-12-02 12:42:55,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,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-12-02 12:42:55,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,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-12-02 12:42:55,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-12-02 12:42:55,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 12:42:55,420 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2018-12-02 12:42:55,487 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-12-02 12:43:00,219 WARN L180 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 156 DAG size of output: 136 [2018-12-02 12:43:00,292 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 12:43:00,292 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 12:43:00,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-12-02 12:43:00,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,293 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,299 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,304 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,305 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,305 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,305 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,308 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,310 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:43:00,310 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:43:00,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,311 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,311 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,319 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,321 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:43:00,321 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:43:00,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:43:00,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:43:00,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:43:00,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:43:00,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:43:00,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:43:00,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,331 INFO L206 nArgumentSynthesizer]: 12 loop disjuncts [2018-12-02 12:43:00,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,338 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-12-02 12:43:00,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,375 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,375 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,376 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,378 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 12:43:00,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 12:43:00,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,381 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,382 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,383 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,383 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,385 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,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-12-02 12:43:00,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,386 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,386 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 12:43:00,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 12:43:00,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 12:43:00,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 12:43:00,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 12:43:00,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 12:43:00,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 12:43:00,388 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 12:43:00,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 12:43:00,388 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 12:43:00,388 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 12:43:00,388 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 12:43:00,388 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 12:43:00,388 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-02 12:43:00,389 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 12:43:00,389 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0) = -2*ULTIMATE.start_main_~i2~0 + 17 Supporting invariants [] [2018-12-02 12:43:00,389 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2018-12-02 12:43:00,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 12:43:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:00,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:43:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 12:43:00,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 12:43:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 12:43:00,481 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-12-02 12:43:00,481 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 494 states and 622 transitions. cyclomatic complexity: 133 Second operand 5 states. [2018-12-02 12:43:00,496 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 494 states and 622 transitions. cyclomatic complexity: 133. Second operand 5 states. Result 771 states and 972 transitions. Complement of second has 6 states. [2018-12-02 12:43:00,496 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-12-02 12:43:00,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-02 12:43:00,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 321 transitions. [2018-12-02 12:43:00,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 321 transitions. Stem has 154 letters. Loop has 57 letters. [2018-12-02 12:43:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:43:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 321 transitions. Stem has 211 letters. Loop has 57 letters. [2018-12-02 12:43:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:43:00,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 321 transitions. Stem has 154 letters. Loop has 114 letters. [2018-12-02 12:43:00,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 12:43:00,497 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 771 states and 972 transitions. [2018-12-02 12:43:00,498 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 12:43:00,498 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 771 states to 0 states and 0 transitions. [2018-12-02 12:43:00,498 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 12:43:00,498 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 12:43:00,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 12:43:00,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 12:43:00,498 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:43:00,498 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 12:43:00,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 12:43:00,499 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2018-12-02 12:43:00,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 12:43:00,499 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-02 12:43:00,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 12:43:00,499 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 12:43:00,499 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 12:43:00,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 12:43:00,499 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:43:00,499 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 12:43:00,500 INFO L442 BuchiCegarLoop]: ======== Iteration 35============ [2018-12-02 12:43:00,500 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 12:43:00,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 12:43:00,500 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 12:43:00,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 12:43:00 BoogieIcfgContainer [2018-12-02 12:43:00,504 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 12:43:00,504 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 12:43:00,504 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 12:43:00,505 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 12:43:00,505 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:39:19" (3/4) ... [2018-12-02 12:43:00,507 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 12:43:00,507 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 12:43:00,507 INFO L168 Benchmark]: Toolchain (without parser) took 222060.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 954.4 MB in the beginning and 751.1 MB in the end (delta: 203.3 MB). Peak memory consumption was 334.9 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:00,508 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:43:00,508 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:00,508 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:00,508 INFO L168 Benchmark]: Boogie Preprocessor took 53.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:00,508 INFO L168 Benchmark]: RCFGBuilder took 755.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.4 MB in the end (delta: 144.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:00,509 INFO L168 Benchmark]: BuchiAutomizer took 220957.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 935.4 MB in the beginning and 751.1 MB in the end (delta: 184.3 MB). Peak memory consumption was 220.5 MB. Max. memory is 11.5 GB. [2018-12-02 12:43:00,509 INFO L168 Benchmark]: Witness Printer took 2.67 ms. Allocated memory is still 1.2 GB. Free memory is still 751.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 12:43:00,615 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.4 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 755.41 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 935.4 MB in the end (delta: 144.3 MB). Peak memory consumption was 144.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 220957.66 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 36.2 MB). Free memory was 935.4 MB in the beginning and 751.1 MB in the end (delta: 184.3 MB). Peak memory consumption was 220.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.67 ms. Allocated memory is still 1.2 GB. Free memory is still 751.1 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 49 terminating modules (34 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 -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. 34 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 220.9s and 35 iterations. TraceHistogramMax:3. Analysis of lassos took 214.3s. Construction of modules took 2.0s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 47. Automata minimization 0.4s AutomataMinimizationTime, 47 MinimizatonAttempts, 19425 StatesRemovedByMinimization, 34 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had 1998 states and ocurred in iteration 26. Nontrivial modules had stage [15, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27493 SDtfs, 25417 SDslu, 38521 SDs, 0 SdLazy, 4103 SolverSat, 446 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN0 SILU0 SILI19 SILT14 lasso0 LassoPreprocessingBenchmarks: Lassos: inital620 mio100 ax154 hnf107 lsp24 ukn75 mio100 lsp100 div151 bol100 ite100 ukn100 eq176 hnf77 smp100 dnf3889 smp18 tf103 neg99 sie105 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 201ms VariablesStem: 0 VariablesLoop: 36 DisjunctsStem: 1 DisjunctsLoop: 16 SupportingInvariants: 0 MotzkinApplications: 32 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 222 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 9 LassoNonterminationAnalysisUnknown: 6 LassoNonterminationAnalysisTime: 77.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...