./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/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 ef22932a563d89d9fa5a5b8bcd7f4a5eeb34d0f3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 03:14:17,998 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 03:14:17,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 03:14:18,006 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 03:14:18,007 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 03:14:18,007 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 03:14:18,008 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 03:14:18,009 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 03:14:18,010 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 03:14:18,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 03:14:18,011 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 03:14:18,012 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 03:14:18,012 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 03:14:18,013 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 03:14:18,014 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 03:14:18,014 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 03:14:18,015 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 03:14:18,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 03:14:18,017 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 03:14:18,018 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 03:14:18,019 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 03:14:18,020 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 03:14:18,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 03:14:18,022 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 03:14:18,022 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 03:14:18,022 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 03:14:18,023 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 03:14:18,024 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 03:14:18,024 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 03:14:18,025 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 03:14:18,025 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 03:14:18,026 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 03:14:18,026 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 03:14:18,026 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 03:14:18,027 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 03:14:18,027 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 03:14:18,027 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-23 03:14:18,038 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 03:14:18,038 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 03:14:18,039 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 03:14:18,039 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 03:14:18,039 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 03:14:18,039 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 03:14:18,039 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 03:14:18,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 03:14:18,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 03:14:18,041 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 03:14:18,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 03:14:18,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 03:14:18,042 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 03:14:18,042 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 03:14:18,042 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 03:14:18,042 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 03:14:18,043 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 03:14:18,043 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_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/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 -> ef22932a563d89d9fa5a5b8bcd7f4a5eeb34d0f3 [2018-11-23 03:14:18,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 03:14:18,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 03:14:18,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 03:14:18,074 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 03:14:18,075 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 03:14:18,075 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c [2018-11-23 03:14:18,110 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/data/ba8e17f59/4210cca29cd3425eaf57e1aae25b44bb/FLAGd734e6ff8 [2018-11-23 03:14:18,555 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 03:14:18,556 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/sv-benchmarks/c/eca-rers2012/Problem02_label25_true-unreach-call_false-termination.c [2018-11-23 03:14:18,564 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/data/ba8e17f59/4210cca29cd3425eaf57e1aae25b44bb/FLAGd734e6ff8 [2018-11-23 03:14:18,576 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/data/ba8e17f59/4210cca29cd3425eaf57e1aae25b44bb [2018-11-23 03:14:18,579 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 03:14:18,580 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 03:14:18,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 03:14:18,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 03:14:18,584 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 03:14:18,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:18,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e234a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18, skipping insertion in model container [2018-11-23 03:14:18,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:18,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 03:14:18,628 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 03:14:18,870 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:14:18,874 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 03:14:18,940 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 03:14:18,953 INFO L195 MainTranslator]: Completed translation [2018-11-23 03:14:18,953 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18 WrapperNode [2018-11-23 03:14:18,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 03:14:18,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 03:14:18,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 03:14:18,954 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 03:14:19,014 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,026 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 03:14:19,061 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 03:14:19,061 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 03:14:19,061 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 03:14:19,069 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,069 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,072 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,072 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,094 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... [2018-11-23 03:14:19,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 03:14:19,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 03:14:19,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 03:14:19,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 03:14:19,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 03:14:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 03:14:19,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 03:14:19,988 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 03:14:19,988 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 03:14:19,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:14:19 BoogieIcfgContainer [2018-11-23 03:14:19,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 03:14:19,989 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 03:14:19,989 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 03:14:19,993 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 03:14:19,994 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:14:19,994 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:14:18" (1/3) ... [2018-11-23 03:14:19,995 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a9c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:14:19, skipping insertion in model container [2018-11-23 03:14:19,995 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:14:19,995 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:14:18" (2/3) ... [2018-11-23 03:14:19,996 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@17a9c79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:14:19, skipping insertion in model container [2018-11-23 03:14:19,996 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 03:14:19,996 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:14:19" (3/3) ... [2018-11-23 03:14:19,997 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label25_true-unreach-call_false-termination.c [2018-11-23 03:14:20,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 03:14:20,043 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 03:14:20,043 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 03:14:20,043 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 03:14:20,043 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 03:14:20,043 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 03:14:20,043 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 03:14:20,043 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 03:14:20,043 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 03:14:20,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 03:14:20,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 03:14:20,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:20,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:20,095 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:20,095 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:14:20,095 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 03:14:20,095 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-11-23 03:14:20,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-11-23 03:14:20,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:20,101 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:20,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:20,102 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-23 03:14:20,109 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-11-23 03:14:20,109 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-11-23 03:14:20,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:20,115 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 03:14:20,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:20,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:20,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:20,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:20,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:20,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:20,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:20,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-11-23 03:14:20,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:20,209 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:20,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:20,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:20,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:20,233 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-11-23 03:14:20,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:20,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:20,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:20,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:20,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:20,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:14:20,430 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-23 03:14:20,493 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:14:20,494 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:14:20,494 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:14:20,494 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:14:20,494 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:14:20,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:14:20,495 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:14:20,495 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 03:14:20,495 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:14:20,495 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:14:20,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-11-23 03:14:20,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:20,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-11-23 03:14:20,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:20,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:20,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:20,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:20,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-11-23 03:14:20,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:14:20,827 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:20,833 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:20,838 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:20,839 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,861 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:20,861 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:20,866 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:20,866 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:20,890 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:20,904 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:20,904 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:20,925 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:20,929 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:20,929 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:20,953 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:20,960 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:20,960 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:20,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:20,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:20,985 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:20,985 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:21,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:21,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:21,006 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:21,006 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:21,025 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:21,025 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:21,053 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:14:21,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:21,076 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:14:21,078 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:14:21,078 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:14:21,078 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:14:21,078 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:14:21,078 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:14:21,078 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:21,078 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:14:21,079 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:14:21,079 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-23 03:14:21,079 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:14:21,079 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:14:21,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:21,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:21,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:21,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:21,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-11-23 03:14:21,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:21,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:21,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-11-23 03:14:21,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:14:21,301 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:14:21,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-11-23 03:14:21,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:21,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:21,318 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,323 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,325 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:21,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,350 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:21,350 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:21,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:21,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:21,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,369 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:21,370 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,375 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 03:14:21,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-11-23 03:14:21,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,379 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,380 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,388 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,389 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,395 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,395 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,398 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 03:14:21,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,413 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,413 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,424 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,425 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,431 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,432 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,434 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,434 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:21,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,442 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 03:14:21,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,443 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,443 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,446 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,446 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,454 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,457 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,457 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,458 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:21,459 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,476 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,477 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,481 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,481 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,484 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,484 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,487 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,487 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,487 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,488 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,490 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,490 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,490 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:21,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,494 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 03:14:21,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-11-23 03:14:21,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,495 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,496 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,503 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,503 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,506 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,506 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,510 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 03:14:21,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,521 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,521 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,522 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,523 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,527 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,528 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,531 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,531 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,534 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,534 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:21,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,536 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,536 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,537 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:21,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,541 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 03:14:21,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,542 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,542 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,544 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,556 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,556 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,556 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,557 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,561 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,561 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,564 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 03:14:21,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,590 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,591 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,592 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,596 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,597 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,597 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,600 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,601 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,601 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,604 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,605 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:21,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,607 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:21,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:21,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,613 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,613 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 03:14:21,614 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,614 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,614 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,614 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,615 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,630 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,630 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,631 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,635 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,635 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,636 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,636 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,639 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:21,639 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,673 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,674 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,674 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,680 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,680 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,685 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,686 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,690 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,690 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,690 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,691 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,691 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,694 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:21,694 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,694 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,694 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,696 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:21,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,705 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 03:14:21,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,707 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,710 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,723 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,724 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,725 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,731 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,732 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,732 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,737 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 03:14:21,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,779 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,782 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,791 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,792 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,799 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,799 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,800 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,806 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,806 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,807 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:21,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,809 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,810 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,810 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:21,812 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:21,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,823 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 03:14:21,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,824 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,826 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,839 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,840 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,840 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,841 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,843 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,844 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,845 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:21,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,864 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,864 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,864 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,865 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,869 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,869 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,870 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,870 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,872 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,873 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,873 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,876 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,876 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,876 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:21,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,878 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,878 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:21,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,879 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:21,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:21,879 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:21,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,885 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 03:14:21,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,886 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,887 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:21,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:21,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,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-11-23 03:14:21,920 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,920 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:21,920 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:21,921 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:21,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:21,924 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:21,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:21,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:21,924 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:21,925 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:21,925 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:21,925 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 03:14:21,925 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:21,928 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 03:14:21,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:22,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:22,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:22,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:22,011 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:22,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:22,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:22,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:22,011 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:22,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:22,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:22,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:22,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:22,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:22,023 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:22,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:22,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:22,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:22,023 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:22,024 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:22,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:22,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:22,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:22,027 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:22,027 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:22,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:22,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:22,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:22,027 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:22,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:22,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:22,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:22,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:22,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:22,031 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:22,031 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:22,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:22,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:22,032 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:22,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:22,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:22,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:22,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:22,036 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:22,036 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:22,036 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:22,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:22,036 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:22,037 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:22,038 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:22,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:22,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:22,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:14:22,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:22,063 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-11-23 03:14:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:22,664 INFO L93 Difference]: Finished difference Result 379 states and 546 transitions. [2018-11-23 03:14:22,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:14:22,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 546 transitions. [2018-11-23 03:14:22,670 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-23 03:14:22,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 372 states and 539 transitions. [2018-11-23 03:14:22,678 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 372 [2018-11-23 03:14:22,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 372 [2018-11-23 03:14:22,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 372 states and 539 transitions. [2018-11-23 03:14:22,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:22,682 INFO L705 BuchiCegarLoop]: Abstraction has 372 states and 539 transitions. [2018-11-23 03:14:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states and 539 transitions. [2018-11-23 03:14:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 371. [2018-11-23 03:14:22,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-11-23 03:14:22,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 537 transitions. [2018-11-23 03:14:22,714 INFO L728 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 03:14:22,714 INFO L608 BuchiCegarLoop]: Abstraction has 371 states and 537 transitions. [2018-11-23 03:14:22,714 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 03:14:22,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 371 states and 537 transitions. [2018-11-23 03:14:22,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 369 [2018-11-23 03:14:22,716 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:22,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:22,717 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:22,717 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:22,718 INFO L794 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 629#L606-2 [2018-11-23 03:14:22,718 INFO L796 eck$LassoCheckResult]: Loop: 629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 731#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 732#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 758#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 693#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 694#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 840#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 630#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 631#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 629#L606-2 [2018-11-23 03:14:22,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:22,718 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-23 03:14:22,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:22,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:22,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:22,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:22,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-11-23 03:14:22,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:22,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:22,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:22,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:14:22,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:22,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:22,736 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-11-23 03:14:22,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:22,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:22,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:22,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:22,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:22,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:22,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 03:14:22,850 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:14:22,850 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:14:22,850 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:14:22,850 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:14:22,850 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:14:22,850 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:22,850 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:14:22,850 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:14:22,850 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 03:14:22,850 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:14:22,851 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:14:22,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,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-11-23 03:14:22,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:22,996 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:14:22,996 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,000 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:23,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:23,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:23,003 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:23,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:23,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:23,024 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,045 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:23,045 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:23,060 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:23,060 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,088 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:23,089 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:23,091 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:23,091 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,123 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:23,123 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:23,132 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:23,132 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,161 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:23,161 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,188 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:14:23,189 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:23,221 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-23 03:14:23,222 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:14:23,223 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:14:23,223 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:14:23,223 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:14:23,223 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 03:14:23,223 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:23,223 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:14:23,223 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:14:23,223 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-23 03:14:23,223 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:14:23,223 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:14:23,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,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-11-23 03:14:23,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:23,383 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:14:23,383 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 03:14:23,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:23,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:23,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,389 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,389 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,389 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:23,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:23,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,393 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,394 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,394 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,398 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,398 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 03:14:23,401 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 03:14:23,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,403 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 03:14:23,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-11-23 03:14:23,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,404 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,404 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,406 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,408 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,408 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,410 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,410 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,412 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,414 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,414 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,416 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,417 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,417 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,421 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,423 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 03:14:23,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,424 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,424 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,424 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,426 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,426 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,429 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,429 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,429 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,431 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,431 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,432 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,432 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,434 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,434 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,437 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,438 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,442 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,443 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,445 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 03:14:23,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,446 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,446 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,449 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,449 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,452 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,452 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,452 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:23,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,454 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,454 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,455 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,455 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,457 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,458 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,458 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:23,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,461 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,462 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:23,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 03:14:23,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,466 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,467 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,470 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 03:14:23,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,470 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,471 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,473 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,473 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,474 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,474 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,477 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,479 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,480 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,480 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,481 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,482 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,484 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,484 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,484 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,489 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,489 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,489 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,496 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,496 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,496 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 03:14:23,497 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 03:14:23,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,500 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,500 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 03:14:23,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-11-23 03:14:23,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,500 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,501 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,504 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,505 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,509 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,509 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,509 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,510 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,511 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,514 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,514 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,515 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,517 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,518 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,518 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,518 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,519 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,524 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,524 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,526 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,537 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 03:14:23,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,538 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,539 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,545 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 03:14:23,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,546 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,546 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,547 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,552 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,552 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,552 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,552 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,553 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,554 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,561 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,562 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,562 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,563 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:23,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,566 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,566 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,569 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,570 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,575 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,575 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,580 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:23,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,590 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,590 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,590 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,590 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,593 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-23 03:14:23,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,608 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,609 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 03:14:23,610 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 03:14:23,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,617 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 03:14:23,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,618 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,618 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,619 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,621 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,624 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,625 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,625 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,625 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,627 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,627 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,627 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,628 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,628 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,630 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,630 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,631 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,682 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,682 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,682 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,683 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,686 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,687 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,687 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,692 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 03:14:23,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,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-11-23 03:14:23,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,699 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 03:14:23,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,700 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 03:14:23,700 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 03:14:23,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,705 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 03:14:23,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,706 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,707 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,711 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,711 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,718 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,718 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,718 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,719 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:23,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,726 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,726 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,727 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,727 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,727 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,730 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,730 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,730 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,734 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,735 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,735 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,735 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:23,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,745 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,745 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,745 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 03:14:23,745 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,747 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 03:14:23,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 03:14:23,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 03:14:23,766 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 03:14:23,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 03:14:23,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 03:14:23,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 03:14:23,766 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 03:14:23,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 03:14:23,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 03:14:23,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 03:14:23,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:14:23,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:23,785 INFO L87 Difference]: Start difference. First operand 371 states and 537 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-23 03:14:24,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:24,138 INFO L93 Difference]: Finished difference Result 656 states and 914 transitions. [2018-11-23 03:14:24,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:14:24,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 656 states and 914 transitions. [2018-11-23 03:14:24,142 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 03:14:24,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 656 states to 656 states and 914 transitions. [2018-11-23 03:14:24,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 656 [2018-11-23 03:14:24,147 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 656 [2018-11-23 03:14:24,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 656 states and 914 transitions. [2018-11-23 03:14:24,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:24,149 INFO L705 BuchiCegarLoop]: Abstraction has 656 states and 914 transitions. [2018-11-23 03:14:24,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states and 914 transitions. [2018-11-23 03:14:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 656. [2018-11-23 03:14:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-11-23 03:14:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 914 transitions. [2018-11-23 03:14:24,161 INFO L728 BuchiCegarLoop]: Abstraction has 656 states and 914 transitions. [2018-11-23 03:14:24,162 INFO L608 BuchiCegarLoop]: Abstraction has 656 states and 914 transitions. [2018-11-23 03:14:24,162 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 03:14:24,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 656 states and 914 transitions. [2018-11-23 03:14:24,165 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 654 [2018-11-23 03:14:24,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:24,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:24,167 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:24,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:24,167 INFO L794 eck$LassoCheckResult]: Stem: 1788#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1664#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1665#L606-2 [2018-11-23 03:14:24,168 INFO L796 eck$LassoCheckResult]: Loop: 1665#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1767#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1920#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1678#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2188#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2186#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2184#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2182#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 2180#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 2178#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2176#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 2174#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 2172#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 2170#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 2168#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 2166#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 2163#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 2161#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2159#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 2157#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 2155#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 2153#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 2151#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 2149#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 2147#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 2145#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 2143#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 2141#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 2139#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 2137#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 2135#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 2133#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 2131#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 2129#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 2126#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 2124#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 2122#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 2120#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 2118#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 2116#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 2114#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 2112#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 2110#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 2108#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 2106#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 2104#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 2102#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 2100#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 2098#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 2096#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 2093#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 2091#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 2089#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1775#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1665#L606-2 [2018-11-23 03:14:24,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-23 03:14:24,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:24,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:24,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:24,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:24,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:24,179 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-11-23 03:14:24,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:24,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:14:24,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:24,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:24,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 03:14:24,236 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:14:24,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 03:14:24,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 03:14:24,236 INFO L87 Difference]: Start difference. First operand 656 states and 914 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-11-23 03:14:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:24,844 INFO L93 Difference]: Finished difference Result 1220 states and 1689 transitions. [2018-11-23 03:14:24,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 03:14:24,845 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1220 states and 1689 transitions. [2018-11-23 03:14:24,850 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1216 [2018-11-23 03:14:24,855 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1220 states to 1220 states and 1689 transitions. [2018-11-23 03:14:24,855 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1220 [2018-11-23 03:14:24,856 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1220 [2018-11-23 03:14:24,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1220 states and 1689 transitions. [2018-11-23 03:14:24,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:24,858 INFO L705 BuchiCegarLoop]: Abstraction has 1220 states and 1689 transitions. [2018-11-23 03:14:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states and 1689 transitions. [2018-11-23 03:14:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1217. [2018-11-23 03:14:24,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2018-11-23 03:14:24,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1683 transitions. [2018-11-23 03:14:24,875 INFO L728 BuchiCegarLoop]: Abstraction has 1217 states and 1683 transitions. [2018-11-23 03:14:24,875 INFO L608 BuchiCegarLoop]: Abstraction has 1217 states and 1683 transitions. [2018-11-23 03:14:24,875 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 03:14:24,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1217 states and 1683 transitions. [2018-11-23 03:14:24,882 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1213 [2018-11-23 03:14:24,883 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:24,883 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:24,884 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:24,884 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:24,884 INFO L794 eck$LassoCheckResult]: Stem: 3670#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3546#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3547#L606-2 [2018-11-23 03:14:24,884 INFO L796 eck$LassoCheckResult]: Loop: 3547#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3650#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3651#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3819#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3679#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3609#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3610#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4300#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3730#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4278#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4276#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4274#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3690#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4607#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4605#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4164#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 4154#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 4153#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 4151#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4149#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 4147#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 4145#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 4143#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 4141#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 4139#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 4137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 4135#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4133#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 4131#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 4129#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 4127#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 4125#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 4123#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 4121#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 4119#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 4117#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 4115#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 4113#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 4111#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 4109#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 4107#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 4105#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 4103#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 4101#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 4099#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 4097#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 4095#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 4093#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 4091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 4089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 4087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 4085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 4083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 4081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 4079#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 4077#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 4075#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 4073#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 4071#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 4069#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 4067#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 4065#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3694#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3547#L606-2 [2018-11-23 03:14:24,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:24,885 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-23 03:14:24,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:24,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:24,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:24,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:24,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:24,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-11-23 03:14:24,889 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:14:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:24,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:14:24,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:24,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:14:24,948 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:14:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:14:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:24,949 INFO L87 Difference]: Start difference. First operand 1217 states and 1683 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-23 03:14:25,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:25,301 INFO L93 Difference]: Finished difference Result 1499 states and 1990 transitions. [2018-11-23 03:14:25,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:14:25,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1499 states and 1990 transitions. [2018-11-23 03:14:25,307 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1495 [2018-11-23 03:14:25,311 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1499 states to 1499 states and 1990 transitions. [2018-11-23 03:14:25,311 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1499 [2018-11-23 03:14:25,312 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1499 [2018-11-23 03:14:25,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1499 states and 1990 transitions. [2018-11-23 03:14:25,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:25,314 INFO L705 BuchiCegarLoop]: Abstraction has 1499 states and 1990 transitions. [2018-11-23 03:14:25,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1499 states and 1990 transitions. [2018-11-23 03:14:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1498. [2018-11-23 03:14:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1498 states. [2018-11-23 03:14:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1498 states to 1498 states and 1988 transitions. [2018-11-23 03:14:25,326 INFO L728 BuchiCegarLoop]: Abstraction has 1498 states and 1988 transitions. [2018-11-23 03:14:25,326 INFO L608 BuchiCegarLoop]: Abstraction has 1498 states and 1988 transitions. [2018-11-23 03:14:25,326 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 03:14:25,326 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1498 states and 1988 transitions. [2018-11-23 03:14:25,330 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 03:14:25,330 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:25,330 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:25,331 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:25,331 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 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] [2018-11-23 03:14:25,332 INFO L794 eck$LassoCheckResult]: Stem: 6393#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6268#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6269#L606-2 [2018-11-23 03:14:25,332 INFO L796 eck$LassoCheckResult]: Loop: 6269#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6373#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6374#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6540#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6577#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7654#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7650#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7591#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6270#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6271#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6272#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6273#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6521#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6560#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6524#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6468#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6394#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6395#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6501#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6891#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6889#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6887#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6492#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6904#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6893#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6892#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6890#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6888#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6886#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6884#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6882#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6880#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6878#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6876#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6874#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6872#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6870#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6868#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6866#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6864#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6862#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6860#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6858#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6856#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6854#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6852#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6850#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6848#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6846#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6844#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6842#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6840#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6838#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6836#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6834#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6832#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6830#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6828#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6826#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6824#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6822#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6820#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6818#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6816#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6814#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6812#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6810#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6808#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6806#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6804#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6802#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6799#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6800#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6269#L606-2 [2018-11-23 03:14:25,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:25,332 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-23 03:14:25,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:25,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:25,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:25,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:25,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:25,336 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-11-23 03:14:25,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:25,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,337 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:14:25,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 03:14:25,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:14:25,386 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:14:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:14:25,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:25,386 INFO L87 Difference]: Start difference. First operand 1498 states and 1988 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-23 03:14:25,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:25,721 INFO L93 Difference]: Finished difference Result 1497 states and 1811 transitions. [2018-11-23 03:14:25,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:14:25,723 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1497 states and 1811 transitions. [2018-11-23 03:14:25,727 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 03:14:25,730 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1497 states to 1497 states and 1811 transitions. [2018-11-23 03:14:25,730 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1497 [2018-11-23 03:14:25,731 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1497 [2018-11-23 03:14:25,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1497 states and 1811 transitions. [2018-11-23 03:14:25,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:25,733 INFO L705 BuchiCegarLoop]: Abstraction has 1497 states and 1811 transitions. [2018-11-23 03:14:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states and 1811 transitions. [2018-11-23 03:14:25,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 1497. [2018-11-23 03:14:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1497 states. [2018-11-23 03:14:25,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1811 transitions. [2018-11-23 03:14:25,745 INFO L728 BuchiCegarLoop]: Abstraction has 1497 states and 1811 transitions. [2018-11-23 03:14:25,745 INFO L608 BuchiCegarLoop]: Abstraction has 1497 states and 1811 transitions. [2018-11-23 03:14:25,745 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 03:14:25,745 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1497 states and 1811 transitions. [2018-11-23 03:14:25,749 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1494 [2018-11-23 03:14:25,749 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:25,749 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:25,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:25,751 INFO L867 BuchiCegarLoop]: Counterexample loop 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:25,751 INFO L794 eck$LassoCheckResult]: Stem: 9390#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9269#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9270#L606-2 [2018-11-23 03:14:25,751 INFO L796 eck$LassoCheckResult]: Loop: 9270#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10194#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10192#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10190#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10188#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10186#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10184#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10169#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10170#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10162#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10163#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10321#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10319#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10317#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10315#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10314#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10312#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10015#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 10016#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 10294#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10292#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 10290#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10288#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10286#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10284#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10282#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10280#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 10278#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9721#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9615#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9716#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9714#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9712#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 9710#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 9708#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9706#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9704#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9702#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9700#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9698#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9696#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9694#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9692#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 9690#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9688#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9686#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9684#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 9682#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 9680#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 9678#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 9676#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 9674#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 9672#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 9670#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 9668#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 9666#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 9664#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 9661#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 9659#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 9657#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 9655#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 9653#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 9651#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 9649#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9647#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 9645#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 9643#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 9641#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 9639#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 9637#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9635#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 9633#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 9631#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 9629#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 9627#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 9625#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 9623#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 9621#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 9618#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9619#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9270#L606-2 [2018-11-23 03:14:25,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-23 03:14:25,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:25,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:25,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-11-23 03:14:25,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:25,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 03:14:25,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:25,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:25,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:25,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 03:14:25,799 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 03:14:25,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 03:14:25,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 03:14:25,800 INFO L87 Difference]: Start difference. First operand 1497 states and 1811 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-23 03:14:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:26,002 INFO L93 Difference]: Finished difference Result 1486 states and 1767 transitions. [2018-11-23 03:14:26,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 03:14:26,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1486 states and 1767 transitions. [2018-11-23 03:14:26,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 03:14:26,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1486 states to 1486 states and 1767 transitions. [2018-11-23 03:14:26,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1486 [2018-11-23 03:14:26,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1486 [2018-11-23 03:14:26,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1486 states and 1767 transitions. [2018-11-23 03:14:26,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:26,013 INFO L705 BuchiCegarLoop]: Abstraction has 1486 states and 1767 transitions. [2018-11-23 03:14:26,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states and 1767 transitions. [2018-11-23 03:14:26,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1486. [2018-11-23 03:14:26,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1486 states. [2018-11-23 03:14:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1486 states to 1486 states and 1767 transitions. [2018-11-23 03:14:26,024 INFO L728 BuchiCegarLoop]: Abstraction has 1486 states and 1767 transitions. [2018-11-23 03:14:26,024 INFO L608 BuchiCegarLoop]: Abstraction has 1486 states and 1767 transitions. [2018-11-23 03:14:26,024 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-23 03:14:26,024 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1486 states and 1767 transitions. [2018-11-23 03:14:26,028 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1483 [2018-11-23 03:14:26,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:26,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:26,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 03:14:26,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:26,029 INFO L794 eck$LassoCheckResult]: Stem: 12381#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12258#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12259#L606-2 [2018-11-23 03:14:26,029 INFO L796 eck$LassoCheckResult]: Loop: 12259#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13015#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13013#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13011#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13009#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13007#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13005#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 13003#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 13001#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12999#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 12997#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 12995#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 12993#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 12990#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12988#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 12986#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 12984#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 12982#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 12980#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 12978#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 12976#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 12974#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 12972#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 12970#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 12968#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12966#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 12964#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 12962#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 12800#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 12801#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13697#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13695#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 13693#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13691#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13689#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13451#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 13450#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13449#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13447#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13445#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13443#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13441#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 13439#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13437#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 13429#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 12808#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 12809#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 12940#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 12938#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 12936#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 12934#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 12868#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 12869#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 13428#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13426#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13424#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 13422#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 13420#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 13418#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 13416#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 13414#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 13413#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12850#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12849#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 12847#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 12846#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 12845#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 12844#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 12842#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 12841#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 12839#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 12837#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 12835#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 12833#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 12831#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 12829#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 12827#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 12825#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12824#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12823#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12821#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12819#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12818#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12816#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12814#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12812#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12275#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12920#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12918#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12916#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12915#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12914#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12912#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12910#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12908#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12906#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12474#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12903#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12901#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12899#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12897#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12895#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12893#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12891#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12890#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12888#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12886#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12884#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12883#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12881#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12879#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12878#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12412#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13071#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13069#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13067#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13065#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13063#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13061#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13059#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13057#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13055#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13052#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13050#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13048#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13046#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13044#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13042#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13040#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13038#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13036#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13034#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13032#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13030#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 13028#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13026#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13024#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 13022#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 13020#L594-1 calculate_output_#res := -2; 13018#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12259#L606-2 [2018-11-23 03:14:26,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:26,030 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-23 03:14:26,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:26,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:26,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:26,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:26,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:26,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:26,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:26,034 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-11-23 03:14:26,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:26,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:26,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:26,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:26,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:26,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:26,073 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-11-23 03:14:26,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:26,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:26,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:26,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:26,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 03:14:26,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 03:14:26,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 03:14:26,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 03:14:27,040 WARN L180 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-23 03:14:27,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 03:14:27,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-23 03:14:27,107 INFO L87 Difference]: Start difference. First operand 1486 states and 1767 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-23 03:14:27,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 03:14:27,968 INFO L93 Difference]: Finished difference Result 1676 states and 1954 transitions. [2018-11-23 03:14:27,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 03:14:27,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1676 states and 1954 transitions. [2018-11-23 03:14:27,974 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1621 [2018-11-23 03:14:27,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1676 states to 1676 states and 1954 transitions. [2018-11-23 03:14:27,980 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1676 [2018-11-23 03:14:27,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1676 [2018-11-23 03:14:27,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1676 states and 1954 transitions. [2018-11-23 03:14:27,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 03:14:27,984 INFO L705 BuchiCegarLoop]: Abstraction has 1676 states and 1954 transitions. [2018-11-23 03:14:27,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states and 1954 transitions. [2018-11-23 03:14:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1535. [2018-11-23 03:14:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1535 states. [2018-11-23 03:14:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 1813 transitions. [2018-11-23 03:14:28,002 INFO L728 BuchiCegarLoop]: Abstraction has 1535 states and 1813 transitions. [2018-11-23 03:14:28,002 INFO L608 BuchiCegarLoop]: Abstraction has 1535 states and 1813 transitions. [2018-11-23 03:14:28,003 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-23 03:14:28,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1535 states and 1813 transitions. [2018-11-23 03:14:28,007 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1480 [2018-11-23 03:14:28,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 03:14:28,008 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 03:14:28,008 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 03:14:28,008 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 03:14:28,008 INFO L794 eck$LassoCheckResult]: Stem: 15562#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15445#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15446#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16192#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16190#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16188#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 15704#L597 [2018-11-23 03:14:28,009 INFO L796 eck$LassoCheckResult]: Loop: 15704#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16221#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16219#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16217#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 16215#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 16213#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 16211#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 16206#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 15704#L597 [2018-11-23 03:14:28,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:28,009 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-11-23 03:14:28,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:28,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:28,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:28,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:28,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-11-23 03:14:28,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:28,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:28,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:28,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:28,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:28,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 03:14:28,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-11-23 03:14:28,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 03:14:28,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 03:14:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:28,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 03:14:28,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 03:14:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 03:14:28,196 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 03:14:28,196 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 03:14:28,196 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 03:14:28,196 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 03:14:28,196 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-23 03:14:28,196 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,196 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 03:14:28,196 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 03:14:28,196 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label25_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-23 03:14:28,196 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 03:14:28,196 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 03:14:28,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,225 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 03:14:28,371 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 03:14:28,371 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,374 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,374 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,376 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,376 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,395 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,395 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,410 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,410 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,412 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,412 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,428 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,428 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,430 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,446 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,446 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,448 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,448 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,464 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,464 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,466 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,466 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,481 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,481 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,483 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,483 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,498 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,498 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,499 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,500 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,515 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,517 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,517 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,532 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,532 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,549 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,551 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,551 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,566 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,568 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,584 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,590 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,590 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,608 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,624 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,624 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,628 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,628 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,643 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,643 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:14:28,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,820 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,820 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,836 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:28,837 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:28,837 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,852 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:28,852 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:28,869 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-23 03:14:28,869 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:29,004 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:29,004 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:29,031 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:29,031 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:29,033 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:29,033 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:29,048 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:29,048 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:29,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:29,050 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 03:14:29,066 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-23 03:14:29,066 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-23 03:14:29,068 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-23 03:14:29,068 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- [2018-11-23 03:14:29,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:14:29 BoogieIcfgContainer [2018-11-23 03:14:29,110 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 03:14:29,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 03:14:29,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 03:14:29,110 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 03:14:29,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:14:19" (3/4) ... [2018-11-23 03:14:29,113 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- [2018-11-23 03:14:29,163 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_04fcddd5-09d7-4dca-b541-7ffe7fcbff42/bin-2019/uautomizer/witness.graphml [2018-11-23 03:14:29,164 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 03:14:29,164 INFO L168 Benchmark]: Toolchain (without parser) took 10584.58 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 486.5 MB). Free memory was 950.0 MB in the beginning and 1.4 GB in the end (delta: -492.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:14:29,165 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 03:14:29,165 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.60 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 915.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:29,165 INFO L168 Benchmark]: Boogie Procedure Inliner took 106.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:29,166 INFO L168 Benchmark]: Boogie Preprocessor took 41.88 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-11-23 03:14:29,166 INFO L168 Benchmark]: RCFGBuilder took 885.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.3 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:29,166 INFO L168 Benchmark]: BuchiAutomizer took 9120.91 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 994.3 MB in the beginning and 1.4 GB in the end (delta: -448.6 MB). Peak memory consumption was 533.4 MB. Max. memory is 11.5 GB. [2018-11-23 03:14:29,167 INFO L168 Benchmark]: Witness Printer took 53.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 320.1 kB). Peak memory consumption was 320.1 kB. Max. memory is 11.5 GB. [2018-11-23 03:14:29,169 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 372.60 ms. Allocated memory is still 1.0 GB. Free memory was 950.0 MB in the beginning and 915.0 MB in the end (delta: 35.0 MB). Peak memory consumption was 35.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 106.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 915.0 MB in the beginning and 1.1 GB in the end (delta: -197.0 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.88 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 885.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 994.3 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9120.91 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 994.3 MB in the beginning and 1.4 GB in the end (delta: -448.6 MB). Peak memory consumption was 533.4 MB. Max. memory is 11.5 GB. * Witness Printer took 53.58 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 320.1 kB). Peak memory consumption was 320.1 kB. 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1535 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 2.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 146 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1535 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1458 SDtfs, 2473 SDslu, 549 SDs, 0 SdLazy, 3950 SolverSat, 842 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 85ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59c6c71=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59c6c71=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59c6c71=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27091914=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; [?] havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0); [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [?] havoc main_#res; [?] havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0; [L603] main_~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] calculate_output_#res := 22; [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L7] ~a~0 := 1; [L8] ~e~0 := 5; [L9] ~d~0 := 4; [L10] ~f~0 := 6; [L11] ~c~0 := 3; [L14] ~u~0 := 21; [L15] ~v~0 := 22; [L16] ~w~0 := 23; [L17] ~x~0 := 24; [L18] ~y~0 := 25; [L19] ~z~0 := 26; [L22] ~a25~0 := 0; [L23] ~a11~0 := 0; [L24] ~a28~0 := 7; [L25] ~a19~0 := 1; [L26] ~a21~0 := 1; [L27] ~a17~0 := 8; [L603] ~output~0 := -1; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND TRUE 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0) [L36] ~a28~0 := 10; [L37] #res := 22; [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; [?] assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; [?] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; [?] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [?] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [?] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [?] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [?] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] assume !false; [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0); [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30-L413] assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); [L35-L413] assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); [L38-L413] assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); [L42-L413] assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); [L47-L413] assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0; [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L614] main_#t~ret3 := calculate_output_#res; [L614] main_~output~0 := main_#t~ret3; [L614] havoc main_#t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc main_~input~0; [L610] main_~input~0 := main_#t~nondet2; [L610] havoc main_#t~nondet2; [L611] COND FALSE !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0) [L614] calculate_output_#in~input := main_~input~0; [L614] havoc calculate_output_#res; [L614] havoc calculate_output_~input; [L29-L598] calculate_output_~input := calculate_output_#in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] calculate_output_#res := -1; [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L614] ~output~0 := #t~ret3; [L614] havoc #t~ret3; [L606-L616] COND FALSE !(false) [L609] havoc ~input~0; [L610] ~input~0 := #t~nondet2; [L610] havoc #t~nondet2; [L611] COND FALSE !((((1 != ~input~0 && 3 != ~input~0) && 4 != ~input~0) && 5 != ~input~0) && 6 != ~input~0) [L29-L598] ~input := #in~input; [L30] COND FALSE !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == ~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) [L35] COND FALSE !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == ~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)) [L38] COND FALSE !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == ~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0) [L42] COND FALSE !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == ~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0) [L47] COND TRUE ((8 == ~a17~0 && ((1 == ~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0 [L48] ~a25~0 := 0; [L49] #res := -1; [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...