./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R --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 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:50:12,621 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:50:12,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:50:12,669 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:50:12,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:50:12,675 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:50:12,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:50:12,681 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:50:12,684 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:50:12,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:50:12,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:50:12,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:50:12,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:50:12,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:50:12,699 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:50:12,702 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:50:12,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:50:12,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:50:12,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:50:12,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:50:12,717 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:50:12,720 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:50:12,722 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:50:12,723 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:50:12,734 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:50:12,735 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:50:12,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:50:12,738 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:50:12,738 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:50:12,739 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:50:12,740 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:50:12,741 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:50:12,743 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:50:12,744 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:50:12,746 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:50:12,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:50:12,747 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:50:12,747 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:50:12,748 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:50:12,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:50:12,749 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:50:12,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-25 16:50:12,799 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:50:12,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:50:12,800 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:50:12,800 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:50:12,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:50:12,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:50:12,802 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:50:12,802 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-25 16:50:12,803 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-25 16:50:12,803 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-25 16:50:12,804 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-25 16:50:12,804 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-25 16:50:12,805 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-25 16:50:12,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:50:12,805 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:50:12,805 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:50:12,805 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:50:12,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:50:12,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:50:12,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-25 16:50:12,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-25 16:50:12,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-25 16:50:12,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:50:12,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:50:12,807 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-25 16:50:12,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:50:12,808 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-25 16:50:12,809 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:50:12,809 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:50:12,809 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:50:12,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:50:12,810 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-25 16:50:12,811 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R 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 -> 0ba3e3db8f44a5e9ad151b8422bee8deebac1dcf47a42cba5485daeafd8d8e80 [2022-11-25 16:50:13,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:50:13,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:50:13,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:50:13,167 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:50:13,167 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:50:13,169 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-11-25 16:50:16,271 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:50:16,570 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:50:16,571 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/sv-benchmarks/c/bitvector/byte_add_1-1.i [2022-11-25 16:50:16,579 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/data/6b0f35ef1/49d37fe33b974d1987ca78cd3fcc82c1/FLAG13d1d63a8 [2022-11-25 16:50:16,595 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/data/6b0f35ef1/49d37fe33b974d1987ca78cd3fcc82c1 [2022-11-25 16:50:16,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:50:16,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:50:16,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:50:16,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:50:16,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:50:16,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c43124e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16, skipping insertion in model container [2022-11-25 16:50:16,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:50:16,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:50:16,805 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2022-11-25 16:50:16,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:50:16,873 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:50:16,887 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/sv-benchmarks/c/bitvector/byte_add_1-1.i[1168,1181] [2022-11-25 16:50:16,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:50:16,925 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:50:16,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16 WrapperNode [2022-11-25 16:50:16,926 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:50:16,927 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:50:16,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:50:16,927 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:50:16,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,981 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 141 [2022-11-25 16:50:16,981 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:50:16,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:50:16,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:50:16,982 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:50:16,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,996 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:16,996 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:17,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:17,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:17,012 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:17,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:17,018 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:50:17,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:50:17,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:50:17,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:50:17,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (1/1) ... [2022-11-25 16:50:17,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:17,067 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:17,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-25 16:50:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:50:17,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:50:17,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:50:17,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:50:17,228 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:50:17,230 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:50:17,760 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:50:17,767 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:50:17,767 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 16:50:17,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:50:17 BoogieIcfgContainer [2022-11-25 16:50:17,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:50:17,771 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-25 16:50:17,771 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-25 16:50:17,776 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-25 16:50:17,777 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:50:17,777 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 25.11 04:50:16" (1/3) ... [2022-11-25 16:50:17,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a9d5b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:50:17, skipping insertion in model container [2022-11-25 16:50:17,779 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:50:17,779 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:50:16" (2/3) ... [2022-11-25 16:50:17,779 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@a9d5b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 25.11 04:50:17, skipping insertion in model container [2022-11-25 16:50:17,780 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-25 16:50:17,780 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:50:17" (3/3) ... [2022-11-25 16:50:17,782 INFO L332 chiAutomizerObserver]: Analyzing ICFG byte_add_1-1.i [2022-11-25 16:50:17,846 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-25 16:50:17,847 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-25 16:50:17,847 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-25 16:50:17,847 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-25 16:50:17,847 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-25 16:50:17,847 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-25 16:50:17,847 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-25 16:50:17,848 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-25 16:50:17,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 45 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:17,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-25 16:50:17,893 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:17,893 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:17,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:50:17,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:17,901 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-25 16:50:17,902 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 46 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 45 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:17,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-11-25 16:50:17,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:17,911 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:17,912 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-11-25 16:50:17,913 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:17,921 INFO L748 eck$LassoCheckResult]: Stem: 21#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4#L59true assume !(0 == mp_add_~a3~0#1 % 256); 16#L59-1true mp_add_~nb~0#1 := 4; 18#L69true assume !(0 == mp_add_~b3~0#1 % 256); 39#L69-1true mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23#L80-2true [2022-11-25 16:50:17,924 INFO L750 eck$LassoCheckResult]: Loop: 23#L80-2true assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 36#L83true assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 46#L83-1true assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7#L89true assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 44#L95-1true assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 17#L99-1true assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 11#L100-1true assume !(2 == mp_add_~i~0#1 % 256); 28#L101-1true assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 31#L102-1true mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 23#L80-2true [2022-11-25 16:50:17,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 889938151, now seen corresponding path program 1 times [2022-11-25 16:50:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:17,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587344253] [2022-11-25 16:50:17,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:17,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:18,164 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:18,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:18,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:18,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:18,253 INFO L85 PathProgramCache]: Analyzing trace with hash 730458878, now seen corresponding path program 1 times [2022-11-25 16:50:18,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:18,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562405664] [2022-11-25 16:50:18,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:18,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:18,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:18,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:18,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562405664] [2022-11-25 16:50:18,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562405664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:18,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:18,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:18,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284990039] [2022-11-25 16:50:18,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:18,446 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:18,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:18,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:18,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:18,487 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 45 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:18,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:18,687 INFO L93 Difference]: Finished difference Result 72 states and 108 transitions. [2022-11-25 16:50:18,689 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 72 states and 108 transitions. [2022-11-25 16:50:18,692 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 47 [2022-11-25 16:50:18,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 72 states to 62 states and 96 transitions. [2022-11-25 16:50:18,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-11-25 16:50:18,700 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-11-25 16:50:18,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 96 transitions. [2022-11-25 16:50:18,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:18,702 INFO L218 hiAutomatonCegarLoop]: Abstraction has 62 states and 96 transitions. [2022-11-25 16:50:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 96 transitions. [2022-11-25 16:50:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2022-11-25 16:50:18,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 59 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 94 transitions. [2022-11-25 16:50:18,741 INFO L240 hiAutomatonCegarLoop]: Abstraction has 60 states and 94 transitions. [2022-11-25 16:50:18,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:18,805 INFO L428 stractBuchiCegarLoop]: Abstraction has 60 states and 94 transitions. [2022-11-25 16:50:18,806 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-25 16:50:18,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 94 transitions. [2022-11-25 16:50:18,807 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-11-25 16:50:18,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:18,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:18,809 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:18,809 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:18,809 INFO L748 eck$LassoCheckResult]: Stem: 154#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 142#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 127#L59 assume !(0 == mp_add_~a3~0#1 % 256); 128#L59-1 mp_add_~nb~0#1 := 4; 150#L69 assume !(0 == mp_add_~b3~0#1 % 256); 138#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 156#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 157#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 144#L83-1 [2022-11-25 16:50:18,810 INFO L750 eck$LassoCheckResult]: Loop: 144#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 131#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 133#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 151#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 140#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 141#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 162#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 165#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 180#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 181#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 153#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 159#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 143#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 144#L83-1 [2022-11-25 16:50:18,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:18,811 INFO L85 PathProgramCache]: Analyzing trace with hash 532072804, now seen corresponding path program 1 times [2022-11-25 16:50:18,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:18,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525347911] [2022-11-25 16:50:18,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:18,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:18,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:19,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:19,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:19,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525347911] [2022-11-25 16:50:19,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525347911] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:19,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:19,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:19,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157989936] [2022-11-25 16:50:19,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:19,215 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:19,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1711027832, now seen corresponding path program 1 times [2022-11-25 16:50:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914113118] [2022-11-25 16:50:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:19,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:19,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:19,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914113118] [2022-11-25 16:50:19,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914113118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:19,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:19,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:19,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339349068] [2022-11-25 16:50:19,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:19,377 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:19,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:19,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:19,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:19,378 INFO L87 Difference]: Start difference. First operand 60 states and 94 transitions. cyclomatic complexity: 36 Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:19,690 INFO L93 Difference]: Finished difference Result 135 states and 202 transitions. [2022-11-25 16:50:19,690 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 135 states and 202 transitions. [2022-11-25 16:50:19,693 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 90 [2022-11-25 16:50:19,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 135 states to 135 states and 202 transitions. [2022-11-25 16:50:19,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 135 [2022-11-25 16:50:19,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2022-11-25 16:50:19,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 135 states and 202 transitions. [2022-11-25 16:50:19,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:19,696 INFO L218 hiAutomatonCegarLoop]: Abstraction has 135 states and 202 transitions. [2022-11-25 16:50:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states and 202 transitions. [2022-11-25 16:50:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 67. [2022-11-25 16:50:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 66 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:19,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 104 transitions. [2022-11-25 16:50:19,703 INFO L240 hiAutomatonCegarLoop]: Abstraction has 67 states and 104 transitions. [2022-11-25 16:50:19,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:50:19,704 INFO L428 stractBuchiCegarLoop]: Abstraction has 67 states and 104 transitions. [2022-11-25 16:50:19,705 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-25 16:50:19,705 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 104 transitions. [2022-11-25 16:50:19,706 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 45 [2022-11-25 16:50:19,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:19,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:19,707 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:19,708 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:19,708 INFO L748 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 349#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 339#L59 assume !(0 == mp_add_~a3~0#1 % 256); 340#L59-1 mp_add_~nb~0#1 := 4; 356#L69 assume !(0 == mp_add_~b3~0#1 % 256); 374#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 363#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 364#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 359#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 360#L84-2 [2022-11-25 16:50:19,708 INFO L750 eck$LassoCheckResult]: Loop: 360#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 365#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 350#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 351#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 335#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 337#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 357#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 344#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 345#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 368#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 369#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 378#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 397#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 360#L84-2 [2022-11-25 16:50:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 1 times [2022-11-25 16:50:19,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:19,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127563692] [2022-11-25 16:50:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:19,727 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:19,743 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:19,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:19,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1856053184, now seen corresponding path program 2 times [2022-11-25 16:50:19,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:19,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801782633] [2022-11-25 16:50:19,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:19,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:19,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:19,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:19,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801782633] [2022-11-25 16:50:19,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801782633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:19,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:19,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30258725] [2022-11-25 16:50:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:19,818 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:19,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:19,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:19,819 INFO L87 Difference]: Start difference. First operand 67 states and 104 transitions. cyclomatic complexity: 39 Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:20,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:20,038 INFO L93 Difference]: Finished difference Result 95 states and 150 transitions. [2022-11-25 16:50:20,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 150 transitions. [2022-11-25 16:50:20,040 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 73 [2022-11-25 16:50:20,041 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 95 states and 150 transitions. [2022-11-25 16:50:20,041 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2022-11-25 16:50:20,041 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2022-11-25 16:50:20,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 95 states and 150 transitions. [2022-11-25 16:50:20,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:20,042 INFO L218 hiAutomatonCegarLoop]: Abstraction has 95 states and 150 transitions. [2022-11-25 16:50:20,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states and 150 transitions. [2022-11-25 16:50:20,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-11-25 16:50:20,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 86 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 136 transitions. [2022-11-25 16:50:20,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 87 states and 136 transitions. [2022-11-25 16:50:20,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:20,052 INFO L428 stractBuchiCegarLoop]: Abstraction has 87 states and 136 transitions. [2022-11-25 16:50:20,052 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-25 16:50:20,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 136 transitions. [2022-11-25 16:50:20,053 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 65 [2022-11-25 16:50:20,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:20,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:20,055 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:20,055 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:20,055 INFO L748 eck$LassoCheckResult]: Stem: 530#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 519#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 503#L59 assume !(0 == mp_add_~a3~0#1 % 256); 504#L59-1 mp_add_~nb~0#1 := 4; 526#L69 assume !(0 == mp_add_~b3~0#1 % 256); 515#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 532#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 533#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 544#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 579#L84-2 [2022-11-25 16:50:20,055 INFO L750 eck$LassoCheckResult]: Loop: 579#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 577#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 573#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 547#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 508#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 510#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 527#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 517#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 518#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 537#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 568#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 566#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 561#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 560#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 551#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 550#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 549#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 548#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 540#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 541#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 583#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 584#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 579#L84-2 [2022-11-25 16:50:20,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 2 times [2022-11-25 16:50:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:20,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936317722] [2022-11-25 16:50:20,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:20,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:20,072 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:20,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:20,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:20,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1033469529, now seen corresponding path program 1 times [2022-11-25 16:50:20,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:20,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972921951] [2022-11-25 16:50:20,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:20,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:20,165 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:50:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:20,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972921951] [2022-11-25 16:50:20,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972921951] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:20,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:20,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:20,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132169666] [2022-11-25 16:50:20,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:20,172 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:20,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:20,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:20,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:20,175 INFO L87 Difference]: Start difference. First operand 87 states and 136 transitions. cyclomatic complexity: 51 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:20,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:20,331 INFO L93 Difference]: Finished difference Result 118 states and 180 transitions. [2022-11-25 16:50:20,332 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 180 transitions. [2022-11-25 16:50:20,333 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 96 [2022-11-25 16:50:20,335 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 118 states and 180 transitions. [2022-11-25 16:50:20,335 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 118 [2022-11-25 16:50:20,335 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 118 [2022-11-25 16:50:20,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 118 states and 180 transitions. [2022-11-25 16:50:20,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:20,337 INFO L218 hiAutomatonCegarLoop]: Abstraction has 118 states and 180 transitions. [2022-11-25 16:50:20,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states and 180 transitions. [2022-11-25 16:50:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2022-11-25 16:50:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.5344827586206897) internal successors, (178), 115 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:20,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 178 transitions. [2022-11-25 16:50:20,345 INFO L240 hiAutomatonCegarLoop]: Abstraction has 116 states and 178 transitions. [2022-11-25 16:50:20,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:20,347 INFO L428 stractBuchiCegarLoop]: Abstraction has 116 states and 178 transitions. [2022-11-25 16:50:20,347 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-25 16:50:20,347 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 116 states and 178 transitions. [2022-11-25 16:50:20,348 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 94 [2022-11-25 16:50:20,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:20,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:20,350 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:20,350 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:20,350 INFO L748 eck$LassoCheckResult]: Stem: 742#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 730#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 714#L59 assume !(0 == mp_add_~a3~0#1 % 256); 715#L59-1 mp_add_~nb~0#1 := 4; 737#L69 assume !(0 == mp_add_~b3~0#1 % 256); 758#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 745#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 746#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 740#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 741#L84-2 [2022-11-25 16:50:20,351 INFO L750 eck$LassoCheckResult]: Loop: 741#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 747#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 731#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 732#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 724#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 777#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 776#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 775#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 770#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 754#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 755#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 774#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 803#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 787#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 781#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 780#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 728#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 729#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 751#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 765#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 766#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 798#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 741#L84-2 [2022-11-25 16:50:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 3 times [2022-11-25 16:50:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:20,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687996034] [2022-11-25 16:50:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:20,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:20,369 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:20,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:20,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:20,385 INFO L85 PathProgramCache]: Analyzing trace with hash -1031622487, now seen corresponding path program 1 times [2022-11-25 16:50:20,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:20,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971603332] [2022-11-25 16:50:20,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:20,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:20,568 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:20,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:20,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971603332] [2022-11-25 16:50:20,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971603332] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:20,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:20,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:50:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778134027] [2022-11-25 16:50:20,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:20,573 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:20,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:20,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:20,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:20,576 INFO L87 Difference]: Start difference. First operand 116 states and 178 transitions. cyclomatic complexity: 64 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:20,918 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2022-11-25 16:50:20,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 377 transitions. [2022-11-25 16:50:20,921 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 200 [2022-11-25 16:50:20,923 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 249 states and 377 transitions. [2022-11-25 16:50:20,924 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 249 [2022-11-25 16:50:20,925 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 249 [2022-11-25 16:50:20,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 249 states and 377 transitions. [2022-11-25 16:50:20,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:20,927 INFO L218 hiAutomatonCegarLoop]: Abstraction has 249 states and 377 transitions. [2022-11-25 16:50:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states and 377 transitions. [2022-11-25 16:50:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 188. [2022-11-25 16:50:20,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 188 states have (on average 1.5265957446808511) internal successors, (287), 187 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:20,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 287 transitions. [2022-11-25 16:50:20,937 INFO L240 hiAutomatonCegarLoop]: Abstraction has 188 states and 287 transitions. [2022-11-25 16:50:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:50:20,943 INFO L428 stractBuchiCegarLoop]: Abstraction has 188 states and 287 transitions. [2022-11-25 16:50:20,943 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-25 16:50:20,943 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 188 states and 287 transitions. [2022-11-25 16:50:20,945 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 161 [2022-11-25 16:50:20,945 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:20,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:20,946 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:20,946 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:20,946 INFO L748 eck$LassoCheckResult]: Stem: 1118#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1105#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1095#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1096#L59-1 mp_add_~nb~0#1 := 4; 1112#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1135#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1136#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1140#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1141#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1142#L84-2 [2022-11-25 16:50:20,947 INFO L750 eck$LassoCheckResult]: Loop: 1142#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1188#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1189#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1172#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1174#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1156#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1155#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1154#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1153#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1152#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1149#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1145#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 1146#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1090#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1092#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1241#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1100#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1101#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 1127#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1150#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1147#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1143#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1142#L84-2 [2022-11-25 16:50:20,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:20,947 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 4 times [2022-11-25 16:50:20,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:20,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817972253] [2022-11-25 16:50:20,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:20,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:20,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:20,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:20,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:20,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:20,993 INFO L85 PathProgramCache]: Analyzing trace with hash 741537833, now seen corresponding path program 1 times [2022-11-25 16:50:20,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:20,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670975641] [2022-11-25 16:50:20,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:20,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:21,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:21,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:21,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670975641] [2022-11-25 16:50:21,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670975641] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:21,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907826884] [2022-11-25 16:50:21,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:21,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:21,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:21,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:21,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 16:50:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:21,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:50:21,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:21,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:21,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:21,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:21,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907826884] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:21,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:21,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-11-25 16:50:21,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904560476] [2022-11-25 16:50:21,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:21,564 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:21,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:21,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:50:21,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:50:21,565 INFO L87 Difference]: Start difference. First operand 188 states and 287 transitions. cyclomatic complexity: 102 Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:22,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:22,061 INFO L93 Difference]: Finished difference Result 329 states and 479 transitions. [2022-11-25 16:50:22,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 479 transitions. [2022-11-25 16:50:22,064 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 257 [2022-11-25 16:50:22,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 329 states and 479 transitions. [2022-11-25 16:50:22,067 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 329 [2022-11-25 16:50:22,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 329 [2022-11-25 16:50:22,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 479 transitions. [2022-11-25 16:50:22,068 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:22,068 INFO L218 hiAutomatonCegarLoop]: Abstraction has 329 states and 479 transitions. [2022-11-25 16:50:22,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 479 transitions. [2022-11-25 16:50:22,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 242. [2022-11-25 16:50:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 242 states have (on average 1.5165289256198347) internal successors, (367), 241 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:22,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 367 transitions. [2022-11-25 16:50:22,080 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242 states and 367 transitions. [2022-11-25 16:50:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:50:22,081 INFO L428 stractBuchiCegarLoop]: Abstraction has 242 states and 367 transitions. [2022-11-25 16:50:22,082 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-25 16:50:22,082 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242 states and 367 transitions. [2022-11-25 16:50:22,084 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 206 [2022-11-25 16:50:22,084 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:22,084 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:22,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:22,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:22,086 INFO L748 eck$LassoCheckResult]: Stem: 1778#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 1765#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 1755#L59 assume !(0 == mp_add_~a3~0#1 % 256); 1756#L59-1 mp_add_~nb~0#1 := 4; 1952#L69 assume !(0 == mp_add_~b3~0#1 % 256); 1795#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 1796#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1806#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1800#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1794#L84-2 [2022-11-25 16:50:22,086 INFO L750 eck$LassoCheckResult]: Loop: 1794#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 1782#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1766#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1767#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1957#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1816#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 1814#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 1813#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1812#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1808#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1807#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1803#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1774#L84 assume !(0 == mp_add_~i~0#1 % 256); 1775#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 1894#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 1893#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 1890#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 1887#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 1884#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 1878#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 1876#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 1818#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 1789#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 1779#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 1780#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 1801#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 1794#L84-2 [2022-11-25 16:50:22,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 5 times [2022-11-25 16:50:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:22,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002988557] [2022-11-25 16:50:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:22,102 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:22,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:22,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:22,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:22,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1687418919, now seen corresponding path program 1 times [2022-11-25 16:50:22,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:22,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678047508] [2022-11-25 16:50:22,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:22,281 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:50:22,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:22,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678047508] [2022-11-25 16:50:22,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678047508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:22,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:22,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:22,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875295351] [2022-11-25 16:50:22,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:22,284 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:22,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:22,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:22,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:22,285 INFO L87 Difference]: Start difference. First operand 242 states and 367 transitions. cyclomatic complexity: 128 Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:22,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:22,516 INFO L93 Difference]: Finished difference Result 362 states and 537 transitions. [2022-11-25 16:50:22,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 362 states and 537 transitions. [2022-11-25 16:50:22,519 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 320 [2022-11-25 16:50:22,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 362 states to 362 states and 537 transitions. [2022-11-25 16:50:22,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 362 [2022-11-25 16:50:22,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 362 [2022-11-25 16:50:22,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 362 states and 537 transitions. [2022-11-25 16:50:22,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:22,524 INFO L218 hiAutomatonCegarLoop]: Abstraction has 362 states and 537 transitions. [2022-11-25 16:50:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states and 537 transitions. [2022-11-25 16:50:22,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 270. [2022-11-25 16:50:22,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 270 states have (on average 1.5333333333333334) internal successors, (414), 269 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 414 transitions. [2022-11-25 16:50:22,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 270 states and 414 transitions. [2022-11-25 16:50:22,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:50:22,549 INFO L428 stractBuchiCegarLoop]: Abstraction has 270 states and 414 transitions. [2022-11-25 16:50:22,550 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-25 16:50:22,550 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 270 states and 414 transitions. [2022-11-25 16:50:22,551 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 246 [2022-11-25 16:50:22,552 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:22,552 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:22,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:22,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:22,553 INFO L748 eck$LassoCheckResult]: Stem: 2394#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 2379#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 2369#L59 assume !(0 == mp_add_~a3~0#1 % 256); 2370#L59-1 mp_add_~nb~0#1 := 4; 2386#L69 assume !(0 == mp_add_~b3~0#1 % 256); 2415#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 2416#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2429#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2421#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2422#L84-2 [2022-11-25 16:50:22,553 INFO L750 eck$LassoCheckResult]: Loop: 2422#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 2539#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 2538#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 2535#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2537#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2464#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 2387#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2388#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2549#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2404#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2405#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2427#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 2411#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2366#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2368#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2417#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 2440#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 2436#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2437#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2424#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2425#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 2547#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 2610#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 2606#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 2564#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 2556#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 2402#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 2403#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 2503#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 2501#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 2500#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 2422#L84-2 [2022-11-25 16:50:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 6 times [2022-11-25 16:50:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:22,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694052504] [2022-11-25 16:50:22,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:22,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:22,579 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:22,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:22,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:22,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1831537572, now seen corresponding path program 1 times [2022-11-25 16:50:22,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:22,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805441653] [2022-11-25 16:50:22,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:22,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:22,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805441653] [2022-11-25 16:50:22,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805441653] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:22,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608287615] [2022-11-25 16:50:22,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:22,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:22,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:22,814 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:22,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 16:50:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:22,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:50:22,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:50:22,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:50:22,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608287615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:22,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:50:22,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2022-11-25 16:50:22,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880474222] [2022-11-25 16:50:22,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:22,972 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:22,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:22,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:50:22,973 INFO L87 Difference]: Start difference. First operand 270 states and 414 transitions. cyclomatic complexity: 146 Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:23,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:23,223 INFO L93 Difference]: Finished difference Result 284 states and 404 transitions. [2022-11-25 16:50:23,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 284 states and 404 transitions. [2022-11-25 16:50:23,225 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 260 [2022-11-25 16:50:23,227 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 284 states to 284 states and 404 transitions. [2022-11-25 16:50:23,227 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 284 [2022-11-25 16:50:23,228 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 284 [2022-11-25 16:50:23,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 284 states and 404 transitions. [2022-11-25 16:50:23,228 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:23,228 INFO L218 hiAutomatonCegarLoop]: Abstraction has 284 states and 404 transitions. [2022-11-25 16:50:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states and 404 transitions. [2022-11-25 16:50:23,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 240. [2022-11-25 16:50:23,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 240 states have (on average 1.4291666666666667) internal successors, (343), 239 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:23,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 343 transitions. [2022-11-25 16:50:23,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 240 states and 343 transitions. [2022-11-25 16:50:23,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:23,235 INFO L428 stractBuchiCegarLoop]: Abstraction has 240 states and 343 transitions. [2022-11-25 16:50:23,235 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-25 16:50:23,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 240 states and 343 transitions. [2022-11-25 16:50:23,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 216 [2022-11-25 16:50:23,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:23,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:23,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:23,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:23,238 INFO L748 eck$LassoCheckResult]: Stem: 3046#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 3033#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 3018#L59 assume !(0 == mp_add_~a3~0#1 % 256); 3019#L59-1 mp_add_~nb~0#1 := 4; 3040#L69 assume !(0 == mp_add_~b3~0#1 % 256); 3064#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 3048#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3049#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3062#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3140#L84-2 [2022-11-25 16:50:23,238 INFO L750 eck$LassoCheckResult]: Loop: 3140#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 3206#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 3204#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 3200#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3195#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3193#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 3189#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3031#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3032#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3055#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3078#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3079#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 3152#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3151#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3177#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3176#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 3109#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3175#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3174#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3173#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3120#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 3117#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 3119#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 3110#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 3108#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 3105#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 3102#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 3095#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 3092#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 3093#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 3139#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 3140#L84-2 [2022-11-25 16:50:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:23,239 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 7 times [2022-11-25 16:50:23,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:23,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956592565] [2022-11-25 16:50:23,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:23,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:23,250 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:23,261 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:23,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:23,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1888795874, now seen corresponding path program 2 times [2022-11-25 16:50:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:23,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107063959] [2022-11-25 16:50:23,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:23,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 25 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:23,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107063959] [2022-11-25 16:50:23,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107063959] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:23,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575130347] [2022-11-25 16:50:23,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:50:23,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:23,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:23,387 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:23,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 16:50:23,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:50:23,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:50:23,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:50:23,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:50:23,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:23,624 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 16:50:23,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575130347] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:23,624 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:23,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2022-11-25 16:50:23,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139244073] [2022-11-25 16:50:23,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:23,626 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:23,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:23,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:50:23,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:50:23,628 INFO L87 Difference]: Start difference. First operand 240 states and 343 transitions. cyclomatic complexity: 105 Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:25,649 INFO L93 Difference]: Finished difference Result 659 states and 859 transitions. [2022-11-25 16:50:25,649 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 859 transitions. [2022-11-25 16:50:25,654 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 615 [2022-11-25 16:50:25,658 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 659 states and 859 transitions. [2022-11-25 16:50:25,658 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2022-11-25 16:50:25,659 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2022-11-25 16:50:25,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 859 transitions. [2022-11-25 16:50:25,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:25,660 INFO L218 hiAutomatonCegarLoop]: Abstraction has 659 states and 859 transitions. [2022-11-25 16:50:25,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 859 transitions. [2022-11-25 16:50:25,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 372. [2022-11-25 16:50:25,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 372 states have (on average 1.3736559139784945) internal successors, (511), 371 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 511 transitions. [2022-11-25 16:50:25,670 INFO L240 hiAutomatonCegarLoop]: Abstraction has 372 states and 511 transitions. [2022-11-25 16:50:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-25 16:50:25,671 INFO L428 stractBuchiCegarLoop]: Abstraction has 372 states and 511 transitions. [2022-11-25 16:50:25,671 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-25 16:50:25,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 511 transitions. [2022-11-25 16:50:25,673 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 339 [2022-11-25 16:50:25,674 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:25,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:25,675 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:25,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:25,675 INFO L748 eck$LassoCheckResult]: Stem: 4250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 4235#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 4225#L59 assume !(0 == mp_add_~a3~0#1 % 256); 4226#L59-1 mp_add_~nb~0#1 := 4; 4243#L69 assume !(0 == mp_add_~b3~0#1 % 256); 4268#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 4269#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4278#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4275#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4270#L84-2 [2022-11-25 16:50:25,676 INFO L750 eck$LassoCheckResult]: Loop: 4270#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 4254#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 4236#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 4237#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4555#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 4238#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 4239#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 4265#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 4570#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4565#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4564#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4259#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4260#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4506#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4266#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4529#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 4522#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 4511#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 4504#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4487#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 4295#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4479#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4476#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4472#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4464#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4460#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4456#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 4457#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 4455#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 4453#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4451#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4449#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 4447#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4445#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4442#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4438#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4432#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4428#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 4429#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 4427#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 4425#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4423#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4421#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4419#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 4396#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4395#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4393#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4390#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4387#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 4383#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 4381#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 4379#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4377#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4375#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4346#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4337#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4335#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4331#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4332#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4389#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 4385#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 4382#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 4380#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4378#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4376#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4316#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4312#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4311#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4308#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 4310#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 4301#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 4297#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 4298#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 4291#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 4292#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 4287#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 4288#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 4279#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 4276#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 4270#L84-2 [2022-11-25 16:50:25,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:25,677 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 8 times [2022-11-25 16:50:25,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:25,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974272730] [2022-11-25 16:50:25,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:25,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:25,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:25,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:25,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:25,699 INFO L85 PathProgramCache]: Analyzing trace with hash -385275002, now seen corresponding path program 1 times [2022-11-25 16:50:25,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:25,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015468476] [2022-11-25 16:50:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:25,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:25,839 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-11-25 16:50:25,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:25,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015468476] [2022-11-25 16:50:25,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015468476] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:25,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:25,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:25,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78655588] [2022-11-25 16:50:25,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:25,841 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:25,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:25,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:25,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:25,842 INFO L87 Difference]: Start difference. First operand 372 states and 511 transitions. cyclomatic complexity: 141 Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:25,945 INFO L93 Difference]: Finished difference Result 563 states and 745 transitions. [2022-11-25 16:50:25,945 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 563 states and 745 transitions. [2022-11-25 16:50:25,949 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 514 [2022-11-25 16:50:25,952 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 563 states to 563 states and 745 transitions. [2022-11-25 16:50:25,953 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 563 [2022-11-25 16:50:25,953 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2022-11-25 16:50:25,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 563 states and 745 transitions. [2022-11-25 16:50:25,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:25,954 INFO L218 hiAutomatonCegarLoop]: Abstraction has 563 states and 745 transitions. [2022-11-25 16:50:25,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states and 745 transitions. [2022-11-25 16:50:25,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 419. [2022-11-25 16:50:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 419 states have (on average 1.3818615751789975) internal successors, (579), 418 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:25,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 579 transitions. [2022-11-25 16:50:25,964 INFO L240 hiAutomatonCegarLoop]: Abstraction has 419 states and 579 transitions. [2022-11-25 16:50:25,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:25,965 INFO L428 stractBuchiCegarLoop]: Abstraction has 419 states and 579 transitions. [2022-11-25 16:50:25,965 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-25 16:50:25,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 419 states and 579 transitions. [2022-11-25 16:50:25,968 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 386 [2022-11-25 16:50:25,968 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:25,968 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:25,971 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:25,971 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:25,972 INFO L748 eck$LassoCheckResult]: Stem: 5191#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 5178#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 5164#L59 assume !(0 == mp_add_~a3~0#1 % 256); 5165#L59-1 mp_add_~nb~0#1 := 4; 5185#L69 assume !(0 == mp_add_~b3~0#1 % 256); 5209#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 5210#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5265#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5233#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5234#L84-2 [2022-11-25 16:50:25,980 INFO L750 eck$LassoCheckResult]: Loop: 5234#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 5254#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 5252#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 5249#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5246#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5247#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 5244#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 5245#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 5543#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5542#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5541#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5540#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5539#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5538#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5537#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5536#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5515#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5533#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 5306#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5521#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5520#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5486#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5487#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5484#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 5471#L90 assume !(0 == mp_add_~i~0#1 % 256); 5483#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 5472#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 5469#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 5467#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5465#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 5464#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 5463#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5462#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5460#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 5457#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5454#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5451#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5431#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5432#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5448#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5447#L96 assume !(0 == mp_add_~partial_sum~0#1); 5419#L96-2 assume 255 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := mp_add_~partial_sum~0#1; 5407#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 5406#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5405#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5404#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5403#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 5402#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5400#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5397#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5394#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5389#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5385#L96 assume !(0 == mp_add_~partial_sum~0#1); 5384#L96-2 assume 255 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := mp_add_~partial_sum~0#1; 5382#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 5380#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5378#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5373#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5353#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5351#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5350#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5348#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5349#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5399#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 5396#L96 assume !(0 == mp_add_~partial_sum~0#1); 5391#L96-2 assume 255 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := mp_add_~partial_sum~0#1; 5386#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 5330#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5331#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5375#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5303#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5302#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5298#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5295#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 5297#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 5286#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 5280#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 5281#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 5274#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 5275#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 5301#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 5300#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 5256#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 5257#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 5234#L84-2 [2022-11-25 16:50:25,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:25,981 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 9 times [2022-11-25 16:50:25,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:25,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130213374] [2022-11-25 16:50:25,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:25,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:26,003 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:26,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:26,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1576696733, now seen corresponding path program 1 times [2022-11-25 16:50:26,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824175139] [2022-11-25 16:50:26,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:26,152 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-11-25 16:50:26,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:26,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824175139] [2022-11-25 16:50:26,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824175139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:26,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:26,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:26,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90780187] [2022-11-25 16:50:26,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:26,154 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:26,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:26,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:26,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:26,155 INFO L87 Difference]: Start difference. First operand 419 states and 579 transitions. cyclomatic complexity: 162 Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:26,223 INFO L93 Difference]: Finished difference Result 507 states and 669 transitions. [2022-11-25 16:50:26,223 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 507 states and 669 transitions. [2022-11-25 16:50:26,230 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 465 [2022-11-25 16:50:26,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 507 states to 507 states and 669 transitions. [2022-11-25 16:50:26,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 507 [2022-11-25 16:50:26,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 507 [2022-11-25 16:50:26,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 507 states and 669 transitions. [2022-11-25 16:50:26,237 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:26,237 INFO L218 hiAutomatonCegarLoop]: Abstraction has 507 states and 669 transitions. [2022-11-25 16:50:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states and 669 transitions. [2022-11-25 16:50:26,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 423. [2022-11-25 16:50:26,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 423 states have (on average 1.3593380614657211) internal successors, (575), 422 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:26,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 575 transitions. [2022-11-25 16:50:26,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 423 states and 575 transitions. [2022-11-25 16:50:26,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:26,250 INFO L428 stractBuchiCegarLoop]: Abstraction has 423 states and 575 transitions. [2022-11-25 16:50:26,253 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-11-25 16:50:26,254 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 423 states and 575 transitions. [2022-11-25 16:50:26,260 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 390 [2022-11-25 16:50:26,260 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:26,260 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:26,262 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:26,262 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:26,263 INFO L748 eck$LassoCheckResult]: Stem: 6125#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 6113#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 6097#L59 assume !(0 == mp_add_~a3~0#1 % 256); 6098#L59-1 mp_add_~nb~0#1 := 4; 6120#L69 assume !(0 == mp_add_~b3~0#1 % 256); 6149#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 6128#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6129#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6123#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 6124#L84-2 [2022-11-25 16:50:26,264 INFO L750 eck$LassoCheckResult]: Loop: 6124#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6130#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6131#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6449#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6445#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6446#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 6443#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 6444#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 6509#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6508#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6507#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6506#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6505#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6504#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6502#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6104#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6105#L96 assume !(0 == mp_add_~partial_sum~0#1); 6501#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 6370#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 6367#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6365#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 6215#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6361#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6359#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6357#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6348#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6346#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6344#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6339#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6498#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6496#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 6494#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6492#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6158#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6159#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6325#L84 assume !(0 == mp_add_~i~0#1 % 256); 6326#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6323#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6321#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 6318#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6314#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6311#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 6308#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 6307#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6306#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6305#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6304#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 6303#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6302#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6300#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6298#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6297#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6277#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6250#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6251#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6247#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6245#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6242#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6238#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6236#L84 assume !(0 == mp_add_~i~0#1 % 256); 6234#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 6232#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 6231#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 6229#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6228#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 6222#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 6220#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 6221#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6216#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6213#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6212#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6211#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6209#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6210#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 6488#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 6197#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 6199#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 6188#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 6189#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 6181#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 6182#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 6176#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 6177#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 6490#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 6124#L84-2 [2022-11-25 16:50:26,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,265 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 10 times [2022-11-25 16:50:26,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949578897] [2022-11-25 16:50:26,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:26,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:26,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:26,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1641427436, now seen corresponding path program 1 times [2022-11-25 16:50:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302796271] [2022-11-25 16:50:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 144 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-25 16:50:26,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:26,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302796271] [2022-11-25 16:50:26,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302796271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:26,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135741461] [2022-11-25 16:50:26,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:26,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:26,563 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:26,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 16:50:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:26,638 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 16:50:26,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:26,767 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 147 proven. 4 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-25 16:50:26,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-11-25 16:50:26,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135741461] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:26,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 16:50:26,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 9 [2022-11-25 16:50:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791486242] [2022-11-25 16:50:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:26,929 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:26,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:26,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-25 16:50:26,930 INFO L87 Difference]: Start difference. First operand 423 states and 575 transitions. cyclomatic complexity: 154 Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:27,227 INFO L93 Difference]: Finished difference Result 833 states and 1114 transitions. [2022-11-25 16:50:27,227 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 833 states and 1114 transitions. [2022-11-25 16:50:27,232 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 766 [2022-11-25 16:50:27,236 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 833 states to 825 states and 1104 transitions. [2022-11-25 16:50:27,236 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 825 [2022-11-25 16:50:27,237 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 825 [2022-11-25 16:50:27,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 825 states and 1104 transitions. [2022-11-25 16:50:27,239 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:27,239 INFO L218 hiAutomatonCegarLoop]: Abstraction has 825 states and 1104 transitions. [2022-11-25 16:50:27,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states and 1104 transitions. [2022-11-25 16:50:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 735. [2022-11-25 16:50:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 735 states have (on average 1.3700680272108843) internal successors, (1007), 734 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1007 transitions. [2022-11-25 16:50:27,253 INFO L240 hiAutomatonCegarLoop]: Abstraction has 735 states and 1007 transitions. [2022-11-25 16:50:27,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:50:27,254 INFO L428 stractBuchiCegarLoop]: Abstraction has 735 states and 1007 transitions. [2022-11-25 16:50:27,254 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-11-25 16:50:27,255 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 735 states and 1007 transitions. [2022-11-25 16:50:27,258 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 702 [2022-11-25 16:50:27,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:27,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:27,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:27,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:27,260 INFO L748 eck$LassoCheckResult]: Stem: 7897#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 7886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 7869#L59 assume !(0 == mp_add_~a3~0#1 % 256); 7870#L59-1 mp_add_~nb~0#1 := 4; 7892#L69 assume !(0 == mp_add_~b3~0#1 % 256); 7916#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 7899#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7900#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8047#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8046#L84-2 [2022-11-25 16:50:27,260 INFO L750 eck$LassoCheckResult]: Loop: 8046#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 8045#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8044#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8041#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8043#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8584#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 8585#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 7977#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7978#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7971#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7972#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8492#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8488#L84 assume !(0 == mp_add_~i~0#1 % 256); 8484#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 8175#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 8481#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 8479#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8473#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8474#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 8471#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 8472#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8503#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 8053#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8502#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8501#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8499#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8495#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8493#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8489#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8482#L96 assume !(0 == mp_add_~partial_sum~0#1); 8477#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 8470#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 8468#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8467#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8456#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 8454#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7984#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7985#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8342#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8339#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8334#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8323#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8424#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8423#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8421#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 8417#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8412#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8410#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8409#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 8407#L90 assume !(0 == mp_add_~i~0#1 % 256); 8405#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 8403#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 8396#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 8389#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8384#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 8381#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 8379#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8377#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8374#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8366#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8236#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8233#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 8230#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 8228#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 8224#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 8222#L96 assume !(0 == mp_add_~partial_sum~0#1); 8220#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 8181#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 8180#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8149#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8130#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 8029#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 8030#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 8000#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7998#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 7993#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 7995#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 8025#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 8026#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 8020#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 7960#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 7961#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 7941#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 7942#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 8176#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 8046#L84-2 [2022-11-25 16:50:27,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:27,260 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 11 times [2022-11-25 16:50:27,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:27,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206355554] [2022-11-25 16:50:27,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:27,269 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:27,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:27,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1291203658, now seen corresponding path program 1 times [2022-11-25 16:50:27,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:27,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180998536] [2022-11-25 16:50:27,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:27,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,400 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 129 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-25 16:50:27,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:27,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180998536] [2022-11-25 16:50:27,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180998536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:27,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179822551] [2022-11-25 16:50:27,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:27,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:27,401 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:27,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:27,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 16:50:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:27,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:50:27,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:27,799 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 147 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 16:50:27,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:28,053 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 123 proven. 27 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 16:50:28,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179822551] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:28,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:28,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 11 [2022-11-25 16:50:28,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237426405] [2022-11-25 16:50:28,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:28,064 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:28,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:28,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 16:50:28,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-11-25 16:50:28,065 INFO L87 Difference]: Start difference. First operand 735 states and 1007 transitions. cyclomatic complexity: 275 Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 11 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:29,076 INFO L93 Difference]: Finished difference Result 3099 states and 4046 transitions. [2022-11-25 16:50:29,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3099 states and 4046 transitions. [2022-11-25 16:50:29,097 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 2580 [2022-11-25 16:50:29,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3099 states to 3043 states and 3975 transitions. [2022-11-25 16:50:29,112 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3043 [2022-11-25 16:50:29,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3043 [2022-11-25 16:50:29,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3043 states and 3975 transitions. [2022-11-25 16:50:29,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:29,119 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3043 states and 3975 transitions. [2022-11-25 16:50:29,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states and 3975 transitions. [2022-11-25 16:50:29,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 2478. [2022-11-25 16:50:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2478 states have (on average 1.3430185633575464) internal successors, (3328), 2477 states have internal predecessors, (3328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:29,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3328 transitions. [2022-11-25 16:50:29,193 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2478 states and 3328 transitions. [2022-11-25 16:50:29,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-25 16:50:29,194 INFO L428 stractBuchiCegarLoop]: Abstraction has 2478 states and 3328 transitions. [2022-11-25 16:50:29,194 INFO L335 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2022-11-25 16:50:29,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2478 states and 3328 transitions. [2022-11-25 16:50:29,206 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 2241 [2022-11-25 16:50:29,206 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:29,206 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:29,207 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:29,207 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:29,207 INFO L748 eck$LassoCheckResult]: Stem: 12270#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 12259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 12242#L59 assume !(0 == mp_add_~a3~0#1 % 256); 12243#L59-1 mp_add_~nb~0#1 := 4; 12265#L69 assume !(0 == mp_add_~b3~0#1 % 256); 12291#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 12273#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12274#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13101#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 13139#L84-2 [2022-11-25 16:50:29,208 INFO L750 eck$LassoCheckResult]: Loop: 13139#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 13759#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13758#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13757#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13755#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 13752#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13751#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 13749#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13746#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 13742#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 13740#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13739#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13737#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13735#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13733#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13734#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13729#L84 assume !(0 == mp_add_~i~0#1 % 256); 13728#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 13318#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 13727#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 13725#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13723#L90 assume !(0 == mp_add_~i~0#1 % 256); 13699#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 13552#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 13695#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13692#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 13693#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13635#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 13629#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13625#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13621#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13613#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13614#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13610#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13583#L90 assume !(0 == mp_add_~i~0#1 % 256); 13582#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13581#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 13580#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13578#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 13576#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 13575#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 13574#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13573#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13572#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 13571#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13570#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13569#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13567#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13565#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13562#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 13560#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13760#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13732#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13722#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 13702#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13700#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13697#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13696#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 13694#L90 assume !(0 == mp_add_~i~0#1 % 256); 13691#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 13690#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 13687#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 13685#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 13682#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 13681#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 13679#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13507#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13487#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13481#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13403#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13401#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13397#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13393#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13389#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 13384#L96 assume !(0 == mp_add_~partial_sum~0#1); 13381#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 13379#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 13378#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13377#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13376#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13097#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13086#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 13082#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 13083#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 13073#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 13071#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 13072#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 13116#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 13110#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 13111#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 13107#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 12310#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 12311#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 13138#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 13139#L84-2 [2022-11-25 16:50:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 12 times [2022-11-25 16:50:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:29,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110856829] [2022-11-25 16:50:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:29,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:29,218 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:29,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:29,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:29,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1317629569, now seen corresponding path program 1 times [2022-11-25 16:50:29,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:29,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739133626] [2022-11-25 16:50:29,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:29,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-25 16:50:29,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:29,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739133626] [2022-11-25 16:50:29,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739133626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:29,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:29,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:50:29,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203880557] [2022-11-25 16:50:29,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:29,493 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:50:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:50:29,493 INFO L87 Difference]: Start difference. First operand 2478 states and 3328 transitions. cyclomatic complexity: 860 Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:30,145 INFO L93 Difference]: Finished difference Result 3257 states and 4289 transitions. [2022-11-25 16:50:30,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3257 states and 4289 transitions. [2022-11-25 16:50:30,165 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2826 [2022-11-25 16:50:30,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3257 states to 3226 states and 4257 transitions. [2022-11-25 16:50:30,181 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3226 [2022-11-25 16:50:30,183 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3226 [2022-11-25 16:50:30,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3226 states and 4257 transitions. [2022-11-25 16:50:30,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:30,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 3226 states and 4257 transitions. [2022-11-25 16:50:30,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3226 states and 4257 transitions. [2022-11-25 16:50:30,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3226 to 2825. [2022-11-25 16:50:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2825 states have (on average 1.345132743362832) internal successors, (3800), 2824 states have internal predecessors, (3800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 3800 transitions. [2022-11-25 16:50:30,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2825 states and 3800 transitions. [2022-11-25 16:50:30,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 16:50:30,276 INFO L428 stractBuchiCegarLoop]: Abstraction has 2825 states and 3800 transitions. [2022-11-25 16:50:30,276 INFO L335 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2022-11-25 16:50:30,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2825 states and 3800 transitions. [2022-11-25 16:50:30,289 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2640 [2022-11-25 16:50:30,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:30,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:30,290 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:30,290 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:30,290 INFO L748 eck$LassoCheckResult]: Stem: 18037#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 18026#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 18016#L59 assume !(0 == mp_add_~a3~0#1 % 256); 18017#L59-1 mp_add_~nb~0#1 := 4; 18032#L69 assume !(0 == mp_add_~b3~0#1 % 256); 18060#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 18040#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18041#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18799#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 18909#L84-2 [2022-11-25 16:50:30,290 INFO L750 eck$LassoCheckResult]: Loop: 18909#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 19213#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 19212#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 19211#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19210#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 19209#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19208#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19207#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19203#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19205#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 19198#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19199#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19194#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19195#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 20763#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 20762#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 19189#L84 assume !(0 == mp_add_~i~0#1 % 256); 19188#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 18907#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 19187#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 19185#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19184#L90 assume !(0 == mp_add_~i~0#1 % 256); 19183#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 19008#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19182#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19179#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19176#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19145#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 19141#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19140#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19139#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19137#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19138#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19129#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19128#L90 assume !(0 == mp_add_~i~0#1 % 256); 19127#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19126#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 19125#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 19121#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 19123#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19116#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19117#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 19112#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19113#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19108#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19109#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19100#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 19099#L90 assume !(0 == mp_add_~i~0#1 % 256); 19098#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 19097#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 19096#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 19093#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 19094#L96 assume 0 == mp_add_~partial_sum~0#1;mp_add_#t~nondet1#1 := 0; 19091#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 19092#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19087#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19088#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19083#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 19084#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19075#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19076#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19175#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 19230#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 19309#L96 assume !(0 == mp_add_~partial_sum~0#1); 19307#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 19305#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 19303#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19301#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19296#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 19060#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 19057#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 19055#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 19053#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 19044#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 19045#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 19310#L96 assume !(0 == mp_add_~partial_sum~0#1); 19308#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 19306#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 19304#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 19302#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 19300#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18961#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18950#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18948#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18945#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 18941#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 18937#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 18921#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 18920#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 18919#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 18918#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 18916#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 18914#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 18911#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 18908#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 18909#L84-2 [2022-11-25 16:50:30,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,291 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 13 times [2022-11-25 16:50:30,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906147548] [2022-11-25 16:50:30,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:30,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:30,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:30,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1406081599, now seen corresponding path program 1 times [2022-11-25 16:50:30,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462517360] [2022-11-25 16:50:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-11-25 16:50:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:30,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462517360] [2022-11-25 16:50:30,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462517360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:30,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:30,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581576417] [2022-11-25 16:50:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:30,454 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:30,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:30,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:30,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:30,455 INFO L87 Difference]: Start difference. First operand 2825 states and 3800 transitions. cyclomatic complexity: 987 Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:30,490 INFO L93 Difference]: Finished difference Result 2825 states and 3658 transitions. [2022-11-25 16:50:30,491 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2825 states and 3658 transitions. [2022-11-25 16:50:30,504 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2640 [2022-11-25 16:50:30,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2825 states to 2825 states and 3658 transitions. [2022-11-25 16:50:30,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2825 [2022-11-25 16:50:30,518 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2825 [2022-11-25 16:50:30,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2825 states and 3658 transitions. [2022-11-25 16:50:30,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:30,522 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2825 states and 3658 transitions. [2022-11-25 16:50:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2825 states and 3658 transitions. [2022-11-25 16:50:30,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2825 to 2594. [2022-11-25 16:50:30,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2594 states have (on average 1.2775636083269082) internal successors, (3314), 2593 states have internal predecessors, (3314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 3314 transitions. [2022-11-25 16:50:30,567 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2594 states and 3314 transitions. [2022-11-25 16:50:30,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:30,568 INFO L428 stractBuchiCegarLoop]: Abstraction has 2594 states and 3314 transitions. [2022-11-25 16:50:30,568 INFO L335 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2022-11-25 16:50:30,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2594 states and 3314 transitions. [2022-11-25 16:50:30,577 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2413 [2022-11-25 16:50:30,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:30,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:30,579 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:30,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:30,579 INFO L748 eck$LassoCheckResult]: Stem: 23692#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 23680#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 23665#L59 assume !(0 == mp_add_~a3~0#1 % 256); 23666#L59-1 mp_add_~nb~0#1 := 4; 23689#L69 assume !(0 == mp_add_~b3~0#1 % 256); 23676#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 23694#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 23695#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25073#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 24986#L84-2 [2022-11-25 16:50:30,579 INFO L750 eck$LassoCheckResult]: Loop: 24986#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 25072#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25071#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25070#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 25069#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 25068#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 25067#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 25066#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 25063#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25060#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 25059#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25057#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 25049#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 25042#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 25043#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 26033#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 25036#L84 assume !(0 == mp_add_~i~0#1 % 256); 25035#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 24985#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 25034#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 25032#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 25031#L90 assume !(0 == mp_add_~i~0#1 % 256); 25026#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 24978#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 25025#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 25022#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 25015#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 24968#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 24965#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24964#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24963#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24961#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24962#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 24954#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 24953#L90 assume !(0 == mp_add_~i~0#1 % 256); 24952#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 24951#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 24950#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 24946#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 24948#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 24941#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 24942#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 24937#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24938#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24933#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24934#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 24926#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 24925#L90 assume !(0 == mp_add_~i~0#1 % 256); 24924#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 24923#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 24922#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 24918#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 24919#L96 assume !(0 == mp_add_~partial_sum~0#1); 24921#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 24917#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 24915#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 24916#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 24911#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24912#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 24907#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24908#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24900#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 24902#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25092#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 25058#L96 assume !(0 == mp_add_~partial_sum~0#1); 25053#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 25044#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 25040#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 25041#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25444#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24851#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24850#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24845#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24846#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 25050#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 25051#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 24836#L96 assume !(0 == mp_add_~partial_sum~0#1); 24834#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 24835#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 24830#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 24831#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 25445#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24816#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24814#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24812#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24809#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 24805#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 24806#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 24828#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 24844#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 24843#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 24842#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 24841#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 24840#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 24837#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 24808#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 24986#L84-2 [2022-11-25 16:50:30,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,580 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 14 times [2022-11-25 16:50:30,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707683979] [2022-11-25 16:50:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:30,587 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:30,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:30,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1452188125, now seen corresponding path program 1 times [2022-11-25 16:50:30,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892558477] [2022-11-25 16:50:30,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-25 16:50:30,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:30,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892558477] [2022-11-25 16:50:30,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892558477] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:30,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:30,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:50:30,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946898233] [2022-11-25 16:50:30,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:30,728 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:30,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:30,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:30,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:30,729 INFO L87 Difference]: Start difference. First operand 2594 states and 3314 transitions. cyclomatic complexity: 732 Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:30,802 INFO L93 Difference]: Finished difference Result 2375 states and 2876 transitions. [2022-11-25 16:50:30,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2375 states and 2876 transitions. [2022-11-25 16:50:30,813 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 2222 [2022-11-25 16:50:30,822 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2375 states to 2375 states and 2876 transitions. [2022-11-25 16:50:30,823 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2375 [2022-11-25 16:50:30,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2375 [2022-11-25 16:50:30,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2375 states and 2876 transitions. [2022-11-25 16:50:30,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:30,853 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2375 states and 2876 transitions. [2022-11-25 16:50:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2375 states and 2876 transitions. [2022-11-25 16:50:30,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2375 to 1935. [2022-11-25 16:50:30,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1935 states have (on average 1.2232558139534884) internal successors, (2367), 1934 states have internal predecessors, (2367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2367 transitions. [2022-11-25 16:50:30,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1935 states and 2367 transitions. [2022-11-25 16:50:30,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:30,889 INFO L428 stractBuchiCegarLoop]: Abstraction has 1935 states and 2367 transitions. [2022-11-25 16:50:30,889 INFO L335 stractBuchiCegarLoop]: ======== Iteration 17 ============ [2022-11-25 16:50:30,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1935 states and 2367 transitions. [2022-11-25 16:50:30,896 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1829 [2022-11-25 16:50:30,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:30,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:30,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:30,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:30,897 INFO L748 eck$LassoCheckResult]: Stem: 28669#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 28657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 28641#L59 assume !(0 == mp_add_~a3~0#1 % 256); 28642#L59-1 mp_add_~nb~0#1 := 4; 28664#L69 assume !(0 == mp_add_~b3~0#1 % 256); 28691#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 28692#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29147#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29145#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 29144#L84-2 [2022-11-25 16:50:30,898 INFO L750 eck$LassoCheckResult]: Loop: 29144#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 29143#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29142#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29140#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29139#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 29138#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29137#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29136#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29133#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29131#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 29129#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29127#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29125#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29123#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29120#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29121#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 29116#L84 assume !(0 == mp_add_~i~0#1 % 256); 29113#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 28806#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 29112#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 29110#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29109#L90 assume !(0 == mp_add_~i~0#1 % 256); 29077#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 28977#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 29074#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29069#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29070#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29103#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 29100#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 29094#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29092#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29048#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29049#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29039#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29038#L90 assume !(0 == mp_add_~i~0#1 % 256); 29037#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 29035#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 29034#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 29031#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29029#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29027#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29025#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 29023#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 29021#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 29018#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 29019#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 29005#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 29003#L90 assume !(0 == mp_add_~i~0#1 % 256); 29001#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 28996#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 28994#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 28993#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 28875#L96 assume !(0 == mp_add_~partial_sum~0#1); 29008#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 29007#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 29006#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 29004#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 29002#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28997#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 28995#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28985#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28982#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28978#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 28979#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 29942#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28958#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28959#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28867#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28866#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28816#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28817#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28976#L84 assume !(0 == mp_add_~i~0#1 % 256); 28805#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 28807#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 28800#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 28801#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 28973#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 29243#L96 assume !(0 == mp_add_~partial_sum~0#1); 29242#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 28960#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 28961#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28951#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28844#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28845#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28840#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28841#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28835#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 28837#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 28830#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 28831#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 28826#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 28827#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 28822#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 28823#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 28818#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 28819#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 28946#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 29144#L84-2 [2022-11-25 16:50:30,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,898 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 15 times [2022-11-25 16:50:30,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202255824] [2022-11-25 16:50:30,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:30,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:30,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:30,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:30,916 INFO L85 PathProgramCache]: Analyzing trace with hash 462096828, now seen corresponding path program 2 times [2022-11-25 16:50:30,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692050627] [2022-11-25 16:50:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 172 proven. 9 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 16:50:31,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:31,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692050627] [2022-11-25 16:50:31,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692050627] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:31,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055079497] [2022-11-25 16:50:31,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:50:31,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:31,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:31,139 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:31,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 16:50:31,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 16:50:31,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:50:31,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:50:31,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:31,560 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 179 proven. 14 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 16:50:31,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:31,818 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 152 proven. 41 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 16:50:31,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055079497] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:31,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:31,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-11-25 16:50:31,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069700636] [2022-11-25 16:50:31,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:31,819 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:31,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:31,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:50:31,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:50:31,821 INFO L87 Difference]: Start difference. First operand 1935 states and 2367 transitions. cyclomatic complexity: 443 Second operand has 15 states, 15 states have (on average 9.933333333333334) internal successors, (149), 15 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:34,354 INFO L93 Difference]: Finished difference Result 2931 states and 3456 transitions. [2022-11-25 16:50:34,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2931 states and 3456 transitions. [2022-11-25 16:50:34,369 INFO L131 ngComponentsAnalysis]: Automaton has 19 accepting balls. 2385 [2022-11-25 16:50:34,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2931 states to 2890 states and 3411 transitions. [2022-11-25 16:50:34,381 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2890 [2022-11-25 16:50:34,383 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2890 [2022-11-25 16:50:34,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2890 states and 3411 transitions. [2022-11-25 16:50:34,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:34,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2890 states and 3411 transitions. [2022-11-25 16:50:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states and 3411 transitions. [2022-11-25 16:50:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 1969. [2022-11-25 16:50:34,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1969 states, 1969 states have (on average 1.2097511427120367) internal successors, (2382), 1968 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2382 transitions. [2022-11-25 16:50:34,436 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1969 states and 2382 transitions. [2022-11-25 16:50:34,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-11-25 16:50:34,437 INFO L428 stractBuchiCegarLoop]: Abstraction has 1969 states and 2382 transitions. [2022-11-25 16:50:34,437 INFO L335 stractBuchiCegarLoop]: ======== Iteration 18 ============ [2022-11-25 16:50:34,437 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1969 states and 2382 transitions. [2022-11-25 16:50:34,464 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 1774 [2022-11-25 16:50:34,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:34,465 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:34,465 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:34,466 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:34,466 INFO L748 eck$LassoCheckResult]: Stem: 34249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 34234#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 34224#L59 assume !(0 == mp_add_~a3~0#1 % 256); 34225#L59-1 mp_add_~nb~0#1 := 4; 34241#L69 assume !(0 == mp_add_~b3~0#1 % 256); 34270#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 34271#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 34814#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34797#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 34997#L84-2 [2022-11-25 16:50:34,466 INFO L750 eck$LassoCheckResult]: Loop: 34997#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35509#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35508#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35507#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35506#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 35505#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35504#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35502#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35499#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35497#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 35495#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35493#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35491#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35489#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35486#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35479#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35478#L84 assume !(0 == mp_add_~i~0#1 % 256); 35477#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 34992#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35476#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35475#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 34453#L90 assume !(0 == mp_add_~i~0#1 % 256); 35473#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 35459#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35460#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35461#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35546#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35379#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 35035#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35036#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35027#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35028#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35375#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35367#L84 assume !(0 == mp_add_~i~0#1 % 256); 35366#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35365#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 35364#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35363#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35362#L90 assume !(0 == mp_add_~i~0#1 % 256); 35361#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35360#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 35359#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 35358#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35231#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35223#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35217#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 35211#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35204#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35205#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35190#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 35157#L84 assume !(0 == mp_add_~i~0#1 % 256); 35176#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 35177#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 35163#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 35164#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 35340#L90 assume !(0 == mp_add_~i~0#1 % 256); 35338#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 35334#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 35331#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 35327#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 35328#L96 assume !(0 == mp_add_~partial_sum~0#1); 35441#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 35439#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 35437#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35435#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35433#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35431#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 35430#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35429#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35428#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 35271#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35550#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 36186#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 36185#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 36184#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35547#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35447#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35444#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35422#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34994#L84 assume !(0 == mp_add_~i~0#1 % 256); 34995#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 34979#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 34981#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 35266#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35259#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 35258#L96 assume !(0 == mp_add_~partial_sum~0#1); 35257#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 35256#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 35253#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35254#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35535#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35534#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35023#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35021#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35022#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 35020#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 35013#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 35014#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 35009#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 35010#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 35005#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 35006#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 35001#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 35002#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 34996#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 34997#L84-2 [2022-11-25 16:50:34,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:34,467 INFO L85 PathProgramCache]: Analyzing trace with hash -685613011, now seen corresponding path program 16 times [2022-11-25 16:50:34,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:34,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811016165] [2022-11-25 16:50:34,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:34,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:34,478 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:34,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1455646208, now seen corresponding path program 1 times [2022-11-25 16:50:34,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:34,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566892761] [2022-11-25 16:50:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:34,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:34,645 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 150 proven. 3 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-25 16:50:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566892761] [2022-11-25 16:50:34,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566892761] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:34,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361894683] [2022-11-25 16:50:34,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:34,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:34,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:34,650 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:34,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 16:50:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:34,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:50:34,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 150 proven. 3 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-25 16:50:34,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:34,859 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 150 proven. 3 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-11-25 16:50:34,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361894683] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:34,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:34,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-25 16:50:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325621650] [2022-11-25 16:50:34,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:34,861 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:34,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:34,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:34,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:50:34,862 INFO L87 Difference]: Start difference. First operand 1969 states and 2382 transitions. cyclomatic complexity: 424 Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:34,921 INFO L93 Difference]: Finished difference Result 1735 states and 2055 transitions. [2022-11-25 16:50:34,921 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1735 states and 2055 transitions. [2022-11-25 16:50:34,928 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 1467 [2022-11-25 16:50:34,944 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1735 states to 1735 states and 2055 transitions. [2022-11-25 16:50:34,944 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1735 [2022-11-25 16:50:34,946 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1735 [2022-11-25 16:50:34,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1735 states and 2055 transitions. [2022-11-25 16:50:34,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:34,948 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1735 states and 2055 transitions. [2022-11-25 16:50:34,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states and 2055 transitions. [2022-11-25 16:50:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1078. [2022-11-25 16:50:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1078 states have (on average 1.179035250463822) internal successors, (1271), 1077 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1271 transitions. [2022-11-25 16:50:34,971 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1078 states and 1271 transitions. [2022-11-25 16:50:34,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:34,972 INFO L428 stractBuchiCegarLoop]: Abstraction has 1078 states and 1271 transitions. [2022-11-25 16:50:34,972 INFO L335 stractBuchiCegarLoop]: ======== Iteration 19 ============ [2022-11-25 16:50:34,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1078 states and 1271 transitions. [2022-11-25 16:50:34,977 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 877 [2022-11-25 16:50:34,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:34,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:34,978 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:34,978 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 1, 1, 1] [2022-11-25 16:50:34,978 INFO L748 eck$LassoCheckResult]: Stem: 38586#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 38572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 38562#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 38564#L61 assume !(0 == mp_add_~a2~0#1 % 256); 38565#L59-1 mp_add_~nb~0#1 := 4; 38627#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 38626#L71 assume !(0 == mp_add_~b2~0#1 % 256); 38624#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 38622#L80-2 assume !((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536); 38621#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 38620#L108 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := 0; 38618#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 38619#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 38635#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 38632#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38631#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 38630#L108 assume !(0 == mp_add_~i~0#1 % 256); 38617#L108-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; 38592#L109-1 [2022-11-25 16:50:34,979 INFO L750 eck$LassoCheckResult]: Loop: 38592#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 38593#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 38577#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38578#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 38636#L108 assume !(0 == mp_add_~i~0#1 % 256); 38603#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 38604#L109-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := 0; 38615#L110-1 assume !(3 == mp_add_~i~0#1 % 256); 38613#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38612#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 38611#L108 assume !(0 == mp_add_~i~0#1 % 256); 38610#L108-2 assume !(1 == mp_add_~i~0#1 % 256); 38609#L109-1 assume !(2 == mp_add_~i~0#1 % 256); 38608#L110-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := 0; 38585#L111-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 38637#L107-1 assume !!(mp_add_~i~0#1 % 256 < 4); 38597#L108 assume !(0 == mp_add_~i~0#1 % 256); 38598#L108-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := 0; 38592#L109-1 [2022-11-25 16:50:34,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:34,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2019093187, now seen corresponding path program 1 times [2022-11-25 16:50:34,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:34,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395897646] [2022-11-25 16:50:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:34,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 16:50:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:35,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395897646] [2022-11-25 16:50:35,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395897646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:35,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:35,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:35,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003202027] [2022-11-25 16:50:35,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:35,055 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:35,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2027259944, now seen corresponding path program 1 times [2022-11-25 16:50:35,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:35,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217033060] [2022-11-25 16:50:35,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:35,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:50:35,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:35,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217033060] [2022-11-25 16:50:35,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217033060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:35,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593618284] [2022-11-25 16:50:35,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:35,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:35,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:35,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:35,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 16:50:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,184 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:50:35,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:35,210 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 16:50:35,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:50:35,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593618284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:35,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:50:35,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-11-25 16:50:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738831081] [2022-11-25 16:50:35,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:35,212 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:35,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:35,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:50:35,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:50:35,213 INFO L87 Difference]: Start difference. First operand 1078 states and 1271 transitions. cyclomatic complexity: 204 Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:35,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:35,364 INFO L93 Difference]: Finished difference Result 1137 states and 1311 transitions. [2022-11-25 16:50:35,364 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1137 states and 1311 transitions. [2022-11-25 16:50:35,368 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 839 [2022-11-25 16:50:35,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1137 states to 995 states and 1117 transitions. [2022-11-25 16:50:35,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 995 [2022-11-25 16:50:35,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 995 [2022-11-25 16:50:35,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 995 states and 1117 transitions. [2022-11-25 16:50:35,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:35,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 995 states and 1117 transitions. [2022-11-25 16:50:35,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states and 1117 transitions. [2022-11-25 16:50:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 800. [2022-11-25 16:50:35,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 800 states have (on average 1.14375) internal successors, (915), 799 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:35,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 915 transitions. [2022-11-25 16:50:35,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 800 states and 915 transitions. [2022-11-25 16:50:35,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:50:35,390 INFO L428 stractBuchiCegarLoop]: Abstraction has 800 states and 915 transitions. [2022-11-25 16:50:35,390 INFO L335 stractBuchiCegarLoop]: ======== Iteration 20 ============ [2022-11-25 16:50:35,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 800 states and 915 transitions. [2022-11-25 16:50:35,392 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 698 [2022-11-25 16:50:35,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:35,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:35,393 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:35,393 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:35,393 INFO L748 eck$LassoCheckResult]: Stem: 40862#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 40849#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 40833#L59 assume 0 == mp_add_~a3~0#1 % 256;mp_add_~na~0#1 := mp_add_~na~0#1 % 256 - 1; 40835#L61 assume !(0 == mp_add_~a2~0#1 % 256); 40836#L59-1 mp_add_~nb~0#1 := 4; 40858#L69 assume !(0 == mp_add_~b3~0#1 % 256); 40859#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 40903#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40904#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40900#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 41206#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 41205#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 41204#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 41203#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 41200#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 41198#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 41197#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41196#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 41195#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41194#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41193#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40981#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40979#L83-1 [2022-11-25 16:50:35,394 INFO L750 eck$LassoCheckResult]: Loop: 40979#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 40978#L90 assume !(0 == mp_add_~i~0#1 % 256); 40977#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 40924#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 40976#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 40975#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40968#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40966#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 40965#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40964#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40961#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40958#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40941#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40942#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 41031#L90 assume !(0 == mp_add_~i~0#1 % 256); 41030#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 41029#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 40921#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 41026#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 41024#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 41023#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 41022#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 41021#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 41020#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 41019#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 41018#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 41009#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 41008#L90 assume !(0 == mp_add_~i~0#1 % 256); 41007#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 41006#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 41005#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 41003#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 41002#L96 assume !(0 == mp_add_~partial_sum~0#1); 41001#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 41000#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 40999#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40998#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40997#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40996#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 40995#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40994#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40993#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 40991#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 40990#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 40989#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 40988#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 40987#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 40986#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 40985#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 40959#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 40960#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 40984#L84 assume !(0 == mp_add_~i~0#1 % 256); 40983#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 40982#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 40980#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 40979#L83-1 [2022-11-25 16:50:35,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1705939075, now seen corresponding path program 1 times [2022-11-25 16:50:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:35,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124713052] [2022-11-25 16:50:35,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:35,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:35,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 16:50:35,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:35,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124713052] [2022-11-25 16:50:35,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124713052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:35,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:35,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:50:35,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045534178] [2022-11-25 16:50:35,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:35,469 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:35,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:35,469 INFO L85 PathProgramCache]: Analyzing trace with hash 168012638, now seen corresponding path program 1 times [2022-11-25 16:50:35,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:35,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119596068] [2022-11-25 16:50:35,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:35,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:35,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:35,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119596068] [2022-11-25 16:50:35,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119596068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:35,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852692588] [2022-11-25 16:50:35,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:35,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:35,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:35,675 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:35,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 16:50:35,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:35,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:50:35,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:35,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 16:50:35,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:35,897 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 16:50:35,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852692588] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:35,898 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:35,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 14 [2022-11-25 16:50:35,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125149326] [2022-11-25 16:50:35,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:35,898 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:35,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:35,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:50:35,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:50:35,899 INFO L87 Difference]: Start difference. First operand 800 states and 915 transitions. cyclomatic complexity: 123 Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:35,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:35,904 INFO L93 Difference]: Finished difference Result 772 states and 878 transitions. [2022-11-25 16:50:35,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 772 states and 878 transitions. [2022-11-25 16:50:35,908 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 698 [2022-11-25 16:50:35,910 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 772 states to 772 states and 878 transitions. [2022-11-25 16:50:35,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 772 [2022-11-25 16:50:35,911 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 772 [2022-11-25 16:50:35,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 772 states and 878 transitions. [2022-11-25 16:50:35,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:35,913 INFO L218 hiAutomatonCegarLoop]: Abstraction has 772 states and 878 transitions. [2022-11-25 16:50:35,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states and 878 transitions. [2022-11-25 16:50:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2022-11-25 16:50:35,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 772 states have (on average 1.1373056994818653) internal successors, (878), 771 states have internal predecessors, (878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 878 transitions. [2022-11-25 16:50:35,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 772 states and 878 transitions. [2022-11-25 16:50:35,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:50:35,927 INFO L428 stractBuchiCegarLoop]: Abstraction has 772 states and 878 transitions. [2022-11-25 16:50:35,927 INFO L335 stractBuchiCegarLoop]: ======== Iteration 21 ============ [2022-11-25 16:50:35,927 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 772 states and 878 transitions. [2022-11-25 16:50:35,930 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 698 [2022-11-25 16:50:35,930 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:35,930 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:35,931 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:35,931 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:35,931 INFO L748 eck$LassoCheckResult]: Stem: 42771#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 42759#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 42747#L59 assume !(0 == mp_add_~a3~0#1 % 256); 42748#L59-1 mp_add_~nb~0#1 := 4; 42766#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 42754#L71 assume !(0 == mp_add_~b2~0#1 % 256); 42755#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 42788#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43171#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 43170#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 43169#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 43168#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 43167#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 43164#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 43166#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 42786#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 42767#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 42757#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 42758#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 42779#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 42782#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43482#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 43478#L84 assume !(0 == mp_add_~i~0#1 % 256); 43477#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 43476#L85-1 [2022-11-25 16:50:35,931 INFO L750 eck$LassoCheckResult]: Loop: 43476#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 42760#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 42761#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 43483#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 43511#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 43508#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 43507#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 43505#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 43504#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 42773#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 42774#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 43506#L84 assume !(0 == mp_add_~i~0#1 % 256); 42789#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 42790#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 43475#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 43474#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 43471#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 43472#L96 assume !(0 == mp_add_~partial_sum~0#1); 43473#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 43469#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 43470#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 43465#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 43466#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 43461#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 43462#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 43457#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43458#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 42793#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 42749#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 42750#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 43502#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 43500#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 43498#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 43496#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 43494#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43492#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 43491#L84 assume !(0 == mp_add_~i~0#1 % 256); 43490#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 42775#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 42776#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 43293#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 43292#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 43290#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 43291#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 43286#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 43287#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 43282#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 43283#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 43484#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 43518#L84 assume !(0 == mp_add_~i~0#1 % 256); 43516#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 43476#L85-1 [2022-11-25 16:50:35,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:35,932 INFO L85 PathProgramCache]: Analyzing trace with hash 2050582902, now seen corresponding path program 1 times [2022-11-25 16:50:35,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:35,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729955251] [2022-11-25 16:50:35,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:35,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:36,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:36,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729955251] [2022-11-25 16:50:36,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729955251] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:36,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:36,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:50:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506172918] [2022-11-25 16:50:36,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:36,052 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash 974166032, now seen corresponding path program 1 times [2022-11-25 16:50:36,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:36,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423688632] [2022-11-25 16:50:36,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-25 16:50:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:36,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423688632] [2022-11-25 16:50:36,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423688632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:36,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:36,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 16:50:36,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086715776] [2022-11-25 16:50:36,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:36,256 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:36,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:36,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:50:36,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:50:36,257 INFO L87 Difference]: Start difference. First operand 772 states and 878 transitions. cyclomatic complexity: 114 Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:36,542 INFO L93 Difference]: Finished difference Result 1903 states and 2171 transitions. [2022-11-25 16:50:36,542 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1903 states and 2171 transitions. [2022-11-25 16:50:36,548 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 1799 [2022-11-25 16:50:36,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1903 states to 1903 states and 2171 transitions. [2022-11-25 16:50:36,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1903 [2022-11-25 16:50:36,563 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1903 [2022-11-25 16:50:36,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1903 states and 2171 transitions. [2022-11-25 16:50:36,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:36,566 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1903 states and 2171 transitions. [2022-11-25 16:50:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states and 2171 transitions. [2022-11-25 16:50:36,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 780. [2022-11-25 16:50:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 780 states have (on average 1.1358974358974359) internal successors, (886), 779 states have internal predecessors, (886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:36,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 886 transitions. [2022-11-25 16:50:36,586 INFO L240 hiAutomatonCegarLoop]: Abstraction has 780 states and 886 transitions. [2022-11-25 16:50:36,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:50:36,587 INFO L428 stractBuchiCegarLoop]: Abstraction has 780 states and 886 transitions. [2022-11-25 16:50:36,587 INFO L335 stractBuchiCegarLoop]: ======== Iteration 22 ============ [2022-11-25 16:50:36,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 780 states and 886 transitions. [2022-11-25 16:50:36,590 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 698 [2022-11-25 16:50:36,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:36,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:36,591 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:36,591 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:36,591 INFO L748 eck$LassoCheckResult]: Stem: 45463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 45452#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 45445#L59 assume !(0 == mp_add_~a3~0#1 % 256); 45446#L59-1 mp_add_~nb~0#1 := 4; 45458#L69 assume !(0 == mp_add_~b3~0#1 % 256); 45460#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 45477#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45773#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 45774#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 45769#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 45770#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 45765#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 45766#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 46137#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 46136#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 46135#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 46134#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 46131#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 46129#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 46128#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 46127#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 46126#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 46125#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 46124#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 46123#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 45749#L83-1 [2022-11-25 16:50:36,591 INFO L750 eck$LassoCheckResult]: Loop: 45749#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 45835#L90 assume !(0 == mp_add_~i~0#1 % 256); 45834#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 45500#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 45833#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 45830#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 45827#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 45825#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 45822#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 45821#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 45820#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 45819#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45818#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 45581#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 45817#L90 assume !(0 == mp_add_~i~0#1 % 256); 45816#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 45813#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 45812#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 45809#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 45807#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 45806#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 45805#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 45804#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 45803#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 45802#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45801#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 45800#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 45799#L90 assume !(0 == mp_add_~i~0#1 % 256); 45798#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 45796#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 45794#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 45791#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 45792#L96 assume !(0 == mp_add_~partial_sum~0#1); 45797#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 45795#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 45793#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 45790#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 45789#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 45787#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 45785#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 45783#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45781#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 45506#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 45507#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 45848#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 45846#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 45845#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 45843#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 45841#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 45778#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 45779#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 45839#L84 assume !(0 == mp_add_~i~0#1 % 256); 45838#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 45837#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 45836#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 45749#L83-1 [2022-11-25 16:50:36,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:36,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1613858065, now seen corresponding path program 1 times [2022-11-25 16:50:36,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:36,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413143025] [2022-11-25 16:50:36,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:36,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413143025] [2022-11-25 16:50:36,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413143025] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448000827] [2022-11-25 16:50:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:36,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:36,866 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:36,869 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:36,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 16:50:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:36,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 16:50:36,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:50:37,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:37,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448000827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:37,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:37,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-11-25 16:50:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956673153] [2022-11-25 16:50:37,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:37,353 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:37,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:37,354 INFO L85 PathProgramCache]: Analyzing trace with hash 168012638, now seen corresponding path program 2 times [2022-11-25 16:50:37,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:37,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407138764] [2022-11-25 16:50:37,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407138764] [2022-11-25 16:50:37,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407138764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:37,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014869023] [2022-11-25 16:50:37,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:50:37,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:37,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:37,509 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:37,527 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 16:50:37,551 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:50:37,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:50:37,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:50:37,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-25 16:50:37,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:50:37,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014869023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:37,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 16:50:37,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-11-25 16:50:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168597075] [2022-11-25 16:50:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:37,618 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:37,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:37,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:50:37,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:50:37,619 INFO L87 Difference]: Start difference. First operand 780 states and 886 transitions. cyclomatic complexity: 114 Second operand has 15 states, 14 states have (on average 5.0) internal successors, (70), 15 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:39,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:39,011 INFO L93 Difference]: Finished difference Result 2420 states and 2681 transitions. [2022-11-25 16:50:39,011 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2420 states and 2681 transitions. [2022-11-25 16:50:39,022 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 2051 [2022-11-25 16:50:39,031 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2420 states to 2341 states and 2598 transitions. [2022-11-25 16:50:39,031 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2341 [2022-11-25 16:50:39,033 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2341 [2022-11-25 16:50:39,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2341 states and 2598 transitions. [2022-11-25 16:50:39,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:39,037 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2341 states and 2598 transitions. [2022-11-25 16:50:39,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states and 2598 transitions. [2022-11-25 16:50:39,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 1142. [2022-11-25 16:50:39,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1142 states have (on average 1.1304728546409808) internal successors, (1291), 1141 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1291 transitions. [2022-11-25 16:50:39,073 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1142 states and 1291 transitions. [2022-11-25 16:50:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 16:50:39,074 INFO L428 stractBuchiCegarLoop]: Abstraction has 1142 states and 1291 transitions. [2022-11-25 16:50:39,074 INFO L335 stractBuchiCegarLoop]: ======== Iteration 23 ============ [2022-11-25 16:50:39,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1142 states and 1291 transitions. [2022-11-25 16:50:39,078 INFO L131 ngComponentsAnalysis]: Automaton has 12 accepting balls. 994 [2022-11-25 16:50:39,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:39,078 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:39,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:39,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:39,082 INFO L748 eck$LassoCheckResult]: Stem: 49027#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 49015#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 49003#L59 assume !(0 == mp_add_~a3~0#1 % 256); 49004#L59-1 mp_add_~nb~0#1 := 4; 49022#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 49010#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 49012#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 49046#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 49287#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49285#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 49283#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 49281#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 49279#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 49277#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 49274#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 49275#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 50024#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 50023#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 50022#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 50021#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 50020#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 50019#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 50018#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 50017#L84 assume !(0 == mp_add_~i~0#1 % 256); 50016#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 49963#L85-1 [2022-11-25 16:50:39,082 INFO L750 eck$LassoCheckResult]: Loop: 49963#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 50015#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 50014#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 50011#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 50009#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49984#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 49979#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 49974#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 49970#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49965#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49959#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 49958#L84 assume !(0 == mp_add_~i~0#1 % 256); 49957#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 49953#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 49952#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 49951#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 49948#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 49944#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49945#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 49940#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 49941#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 49936#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49937#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49933#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 49932#L84 assume !(0 == mp_add_~i~0#1 % 256); 49931#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 49930#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 49929#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 49928#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 49926#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 49925#L96 assume !(0 == mp_add_~partial_sum~0#1); 49924#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 49923#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 49922#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 49921#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 49920#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 49919#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 49918#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49917#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49915#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 49912#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 49913#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 50029#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 50028#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 49986#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 50008#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 49982#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 49983#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 49972#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 49973#L84 assume !(0 == mp_add_~i~0#1 % 256); 49962#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 49963#L85-1 [2022-11-25 16:50:39,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:39,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1030182212, now seen corresponding path program 1 times [2022-11-25 16:50:39,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:39,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147807701] [2022-11-25 16:50:39,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:39,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:39,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:39,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147807701] [2022-11-25 16:50:39,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147807701] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:50:39,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:50:39,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 16:50:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419677344] [2022-11-25 16:50:39,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:50:39,236 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1543897238, now seen corresponding path program 1 times [2022-11-25 16:50:39,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:39,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939629273] [2022-11-25 16:50:39,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:39,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:39,380 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 35 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 16:50:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:39,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939629273] [2022-11-25 16:50:39,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939629273] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:39,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752639736] [2022-11-25 16:50:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:39,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:39,390 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:39,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 16:50:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:39,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-25 16:50:39,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 16:50:39,546 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:39,698 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 52 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 16:50:39,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752639736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:39,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:39,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 14 [2022-11-25 16:50:39,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785206454] [2022-11-25 16:50:39,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:39,699 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:39,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:39,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:50:39,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:50:39,700 INFO L87 Difference]: Start difference. First operand 1142 states and 1291 transitions. cyclomatic complexity: 161 Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:40,330 INFO L93 Difference]: Finished difference Result 2786 states and 3136 transitions. [2022-11-25 16:50:40,330 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2786 states and 3136 transitions. [2022-11-25 16:50:40,341 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 2553 [2022-11-25 16:50:40,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2786 states to 2786 states and 3136 transitions. [2022-11-25 16:50:40,351 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2786 [2022-11-25 16:50:40,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2786 [2022-11-25 16:50:40,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2786 states and 3136 transitions. [2022-11-25 16:50:40,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:40,357 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2786 states and 3136 transitions. [2022-11-25 16:50:40,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2786 states and 3136 transitions. [2022-11-25 16:50:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2786 to 1023. [2022-11-25 16:50:40,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1023 states have (on average 1.1329423264907137) internal successors, (1159), 1022 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:40,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1159 transitions. [2022-11-25 16:50:40,415 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1023 states and 1159 transitions. [2022-11-25 16:50:40,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 16:50:40,416 INFO L428 stractBuchiCegarLoop]: Abstraction has 1023 states and 1159 transitions. [2022-11-25 16:50:40,416 INFO L335 stractBuchiCegarLoop]: ======== Iteration 24 ============ [2022-11-25 16:50:40,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1023 states and 1159 transitions. [2022-11-25 16:50:40,419 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 888 [2022-11-25 16:50:40,419 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:40,419 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:40,420 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:40,420 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:40,420 INFO L748 eck$LassoCheckResult]: Stem: 53285#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 53274#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 53264#L59 assume !(0 == mp_add_~a3~0#1 % 256); 53265#L59-1 mp_add_~nb~0#1 := 4; 53280#L69 assume !(0 == mp_add_~b3~0#1 % 256); 53282#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 53300#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 54071#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 54070#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 54069#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 54068#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 54067#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 54066#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 54065#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 54064#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 54063#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 54062#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 54059#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 54057#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 54056#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 54055#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 54054#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 54053#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 54052#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 54051#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 54050#L84 assume !(0 == mp_add_~i~0#1 % 256); 54049#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 53360#L85-1 [2022-11-25 16:50:40,421 INFO L750 eck$LassoCheckResult]: Loop: 53360#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 54046#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 54044#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 54042#L90 assume !(0 == mp_add_~i~0#1 % 256); 54041#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 53840#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 54022#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 54020#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 54018#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 54015#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 54012#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 54009#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 54006#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 54001#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 53838#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 53837#L84 assume !(0 == mp_add_~i~0#1 % 256); 53836#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 53828#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 53827#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 53826#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 53825#L90 assume !(0 == mp_add_~i~0#1 % 256); 53824#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 53823#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 53821#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 53818#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 53819#L96 assume !(0 == mp_add_~partial_sum~0#1); 53822#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 53820#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 53817#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 53815#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 53813#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 53811#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 53809#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 53807#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 53782#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 53778#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 53776#L90 assume !(0 == mp_add_~i~0#1 % 256); 53774#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 53772#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 53770#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 53768#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 53766#L96 assume !(0 == mp_add_~partial_sum~0#1); 53763#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 53759#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 53756#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 53753#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 53751#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 53750#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 53749#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 53748#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 53746#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 53744#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 53745#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 54019#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 53733#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 53732#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 53731#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 53730#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 53729#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 53364#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 53365#L84 assume !(0 == mp_add_~i~0#1 % 256); 53359#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 53360#L85-1 [2022-11-25 16:50:40,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:40,421 INFO L85 PathProgramCache]: Analyzing trace with hash 434383451, now seen corresponding path program 1 times [2022-11-25 16:50:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:40,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997691523] [2022-11-25 16:50:40,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:40,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:40,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:40,434 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:40,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:40,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash 258956963, now seen corresponding path program 1 times [2022-11-25 16:50:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:40,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728699059] [2022-11-25 16:50:40,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:40,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:40,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728699059] [2022-11-25 16:50:40,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728699059] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:40,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561379400] [2022-11-25 16:50:40,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:40,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:40,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:40,619 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:40,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 16:50:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:40,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-25 16:50:40,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 16:50:40,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:41,023 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 16:50:41,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561379400] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:41,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:41,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2022-11-25 16:50:41,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004056144] [2022-11-25 16:50:41,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:41,025 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-25 16:50:41,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:41,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 16:50:41,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:50:41,027 INFO L87 Difference]: Start difference. First operand 1023 states and 1159 transitions. cyclomatic complexity: 147 Second operand has 14 states, 13 states have (on average 10.692307692307692) internal successors, (139), 14 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:42,632 INFO L93 Difference]: Finished difference Result 934 states and 1017 transitions. [2022-11-25 16:50:42,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 934 states and 1017 transitions. [2022-11-25 16:50:42,638 INFO L131 ngComponentsAnalysis]: Automaton has 10 accepting balls. 163 [2022-11-25 16:50:42,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 934 states to 842 states and 902 transitions. [2022-11-25 16:50:42,653 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 842 [2022-11-25 16:50:42,653 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 842 [2022-11-25 16:50:42,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 842 states and 902 transitions. [2022-11-25 16:50:42,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:42,655 INFO L218 hiAutomatonCegarLoop]: Abstraction has 842 states and 902 transitions. [2022-11-25 16:50:42,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states and 902 transitions. [2022-11-25 16:50:42,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 530. [2022-11-25 16:50:42,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 530 states have (on average 1.090566037735849) internal successors, (578), 529 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 578 transitions. [2022-11-25 16:50:42,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 530 states and 578 transitions. [2022-11-25 16:50:42,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 16:50:42,670 INFO L428 stractBuchiCegarLoop]: Abstraction has 530 states and 578 transitions. [2022-11-25 16:50:42,670 INFO L335 stractBuchiCegarLoop]: ======== Iteration 25 ============ [2022-11-25 16:50:42,671 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 530 states and 578 transitions. [2022-11-25 16:50:42,673 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 94 [2022-11-25 16:50:42,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:42,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:42,674 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 16:50:42,675 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:42,675 INFO L748 eck$LassoCheckResult]: Stem: 55674#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 55664#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 55657#L59 assume !(0 == mp_add_~a3~0#1 % 256); 55658#L59-1 mp_add_~nb~0#1 := 4; 55669#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 55661#L71 assume !(0 == mp_add_~b2~0#1 % 256); 55662#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 55827#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 55828#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 55823#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 55824#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 55819#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 55820#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 55815#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 55816#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 55811#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 55812#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 55806#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 55807#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 55798#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 55799#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 55794#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 55795#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 55790#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 55791#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 55787#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 55785#L84 assume !(0 == mp_add_~i~0#1 % 256); 55786#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 55781#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 55782#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 55776#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 55778#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 55842#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 55841#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 55840#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 55839#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 55838#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 55837#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 55836#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 55835#L84 assume !(0 == mp_add_~i~0#1 % 256); 55834#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 55833#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 55831#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 55832#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 55747#L89 assume mp_add_~partial_sum~0#1 % 65536 > 255; 55864#L96 assume !(0 == mp_add_~partial_sum~0#1); 55865#L96-2 assume !(255 == mp_add_~partial_sum~0#1);mp_add_#t~nondet1#1 := ~bitwiseAnd(mp_add_~partial_sum~0#1, 255);assume mp_add_~partial_sum~0#1 < 0 || (mp_add_#t~nondet1#1 <= mp_add_~partial_sum~0#1 && mp_add_#t~nondet1#1 <= 255);assume mp_add_#t~nondet1#1 >= 0;assume mp_add_~partial_sum~0#1 >= 0 || mp_add_#t~nondet1#1 > 255 + mp_add_~partial_sum~0#1; 55862#L96-4 mp_add_~partial_sum~0#1 := mp_add_#t~nondet1#1;havoc mp_add_#t~nondet1#1;mp_add_~carry~0#1 := 1; 55863#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 55858#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 55859#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 55854#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 55855#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 55850#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 55851#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 55998#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 56058#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 56051#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 56057#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 56056#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 56054#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 56053#L102-1 [2022-11-25 16:50:42,675 INFO L750 eck$LassoCheckResult]: Loop: 56053#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 56052#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 56040#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 56005#L84 assume !(0 == mp_add_~i~0#1 % 256); 56002#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 55999#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 55994#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 55995#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 56064#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 56063#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 56062#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 56061#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 56055#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 56053#L102-1 [2022-11-25 16:50:42,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:42,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1721435283, now seen corresponding path program 1 times [2022-11-25 16:50:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:42,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963461676] [2022-11-25 16:50:42,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:42,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 37 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 16:50:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963461676] [2022-11-25 16:50:42,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963461676] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:42,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [161746105] [2022-11-25 16:50:42,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:42,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:42,903 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:42,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:42,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 16:50:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:43,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 16:50:43,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:43,083 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:50:43,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:43,198 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 51 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 16:50:43,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [161746105] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:43,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:43,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 7] total 15 [2022-11-25 16:50:43,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860851443] [2022-11-25 16:50:43,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:43,199 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:43,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:43,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1458413444, now seen corresponding path program 1 times [2022-11-25 16:50:43,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:43,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729685799] [2022-11-25 16:50:43,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:43,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:43,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:43,203 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:43,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:43,318 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:50:43,319 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:50:43,319 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:50:43,319 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:50:43,319 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:50:43,319 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:43,320 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:50:43,320 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:50:43,320 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2022-11-25 16:50:43,320 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:50:43,320 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:50:43,340 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:43,353 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:43,609 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:50:43,610 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:50:43,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:43,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:43,618 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:43,619 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-11-25 16:50:43,621 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:50:43,621 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:43,656 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-11-25 16:50:43,656 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Honda state: {ULTIMATE.start_mp_add_~carry~0#1=0, ULTIMATE.start_mp_add_~partial_sum~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-11-25 16:50:43,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-11-25 16:50:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:43,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:43,668 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:43,681 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:50:43,682 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:43,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-11-25 16:50:43,768 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:43,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:43,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:43,770 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:43,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:50:43,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:43,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-11-25 16:50:44,461 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:50:44,467 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:44,468 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:50:44,468 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:50:44,468 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:50:44,468 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:50:44,468 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:50:44,468 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:44,468 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:50:44,468 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:50:44,468 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration25_Loop [2022-11-25 16:50:44,468 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:50:44,468 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:50:44,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:44,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:44,797 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:50:44,802 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:50:44,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:44,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:44,805 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:44,815 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:44,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-11-25 16:50:44,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:44,829 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:44,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:44,830 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:44,830 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:50:44,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:50:44,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:44,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:44,863 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:44,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:44,863 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:44,865 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:44,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:44,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-11-25 16:50:44,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:44,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:44,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:44,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:44,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:50:44,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:50:44,901 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:44,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:44,923 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:44,923 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-25 16:50:44,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:44,923 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:44,926 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:44,936 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:44,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-11-25 16:50:44,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:44,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:44,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:44,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:44,951 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:44,960 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:44,960 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:44,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:44,970 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-11-25 16:50:44,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:44,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:44,975 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:44,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-11-25 16:50:44,983 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:44,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:44,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:44,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:44,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:44,997 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:45,010 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:45,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,037 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,037 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-25 16:50:45,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,038 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,039 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,053 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-11-25 16:50:45,067 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:45,068 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,068 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,068 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,068 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:45,075 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:45,076 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,105 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,107 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-11-25 16:50:45,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:45,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,127 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,127 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:45,130 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:45,131 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,142 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,142 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-25 16:50:45,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,143 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-11-25 16:50:45,146 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:45,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,158 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:45,168 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:45,168 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,199 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,211 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,215 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-11-25 16:50:45,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:45,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,235 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:45,239 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:45,239 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,267 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,267 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-25 16:50:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,268 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,269 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-11-25 16:50:45,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,293 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,294 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:45,294 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,294 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,294 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,294 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:45,301 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:45,301 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,315 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,323 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,325 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-11-25 16:50:45,350 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,350 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:45,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,350 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:45,354 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:45,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,366 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,377 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,378 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-25 16:50:45,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,378 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,379 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-11-25 16:50:45,402 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,402 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:50:45,402 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,402 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,402 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,402 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:45,411 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:45,412 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,434 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,442 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-11-25 16:50:45,463 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,463 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:50:45,463 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,464 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,464 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,464 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:45,469 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:45,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,491 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,501 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,501 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-25 16:50:45,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,503 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-11-25 16:50:45,521 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,521 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:45,521 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,521 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:45,538 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:45,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,563 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,576 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,579 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-11-25 16:50:45,593 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,594 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:45,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,594 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:45,599 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:45,600 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,634 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-25 16:50:45,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,636 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-11-25 16:50:45,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,655 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,656 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:45,656 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,656 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,656 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:45,667 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:45,667 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,687 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,699 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,703 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-11-25 16:50:45,716 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,716 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:45,716 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,717 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:45,719 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:45,720 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,746 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,747 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-25 16:50:45,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,748 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-11-25 16:50:45,767 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,768 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:45,768 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,768 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,768 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,768 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:50:45,778 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:50:45,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,799 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,811 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:45,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:45,813 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:45,817 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:45,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-11-25 16:50:45,831 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:45,831 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:45,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:45,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:45,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:45,832 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:50:45,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:50:45,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:45,859 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:45,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:45,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:45,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-25 16:50:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-11-25 16:50:45,870 INFO L87 Difference]: Start difference. First operand 530 states and 578 transitions. cyclomatic complexity: 54 Second operand has 15 states, 15 states have (on average 7.8) internal successors, (117), 15 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:47,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:47,424 INFO L93 Difference]: Finished difference Result 963 states and 1024 transitions. [2022-11-25 16:50:47,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 963 states and 1024 transitions. [2022-11-25 16:50:47,429 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 141 [2022-11-25 16:50:47,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 963 states to 963 states and 1024 transitions. [2022-11-25 16:50:47,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 963 [2022-11-25 16:50:47,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 963 [2022-11-25 16:50:47,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 963 states and 1024 transitions. [2022-11-25 16:50:47,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:47,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 963 states and 1024 transitions. [2022-11-25 16:50:47,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states and 1024 transitions. [2022-11-25 16:50:47,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 625. [2022-11-25 16:50:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 625 states have (on average 1.0864) internal successors, (679), 624 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 679 transitions. [2022-11-25 16:50:47,446 INFO L240 hiAutomatonCegarLoop]: Abstraction has 625 states and 679 transitions. [2022-11-25 16:50:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 16:50:47,447 INFO L428 stractBuchiCegarLoop]: Abstraction has 625 states and 679 transitions. [2022-11-25 16:50:47,447 INFO L335 stractBuchiCegarLoop]: ======== Iteration 26 ============ [2022-11-25 16:50:47,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 625 states and 679 transitions. [2022-11-25 16:50:47,450 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 94 [2022-11-25 16:50:47,450 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:47,450 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:47,456 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:47,457 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:47,457 INFO L748 eck$LassoCheckResult]: Stem: 57633#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 57623#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 57616#L59 assume !(0 == mp_add_~a3~0#1 % 256); 57617#L59-1 mp_add_~nb~0#1 := 4; 57628#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 57620#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 57622#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 57650#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 57694#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 57693#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 57692#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 57691#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 57690#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 57689#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 57688#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 57687#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 57686#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 57685#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 57684#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 57682#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 57683#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 57912#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 57911#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 57910#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 57909#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 57908#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 57906#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 57905#L84 assume !(0 == mp_add_~i~0#1 % 256); 57904#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 57903#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 57902#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 57737#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 57738#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 57817#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 58153#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 58152#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 58151#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 58150#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 58149#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 58148#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 58147#L84 assume !(0 == mp_add_~i~0#1 % 256); 58146#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 58144#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 58145#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 58231#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 57802#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 57937#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 58230#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 58229#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 58228#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 57638#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 57639#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 58002#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 58223#L84 assume !(0 == mp_add_~i~0#1 % 256); 58221#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 58219#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 58217#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 57652#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 57611#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 57612#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 58234#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 58233#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 58232#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 57637#L102-1 [2022-11-25 16:50:47,457 INFO L750 eck$LassoCheckResult]: Loop: 57637#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 58226#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 58001#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 57631#L84 assume !(0 == mp_add_~i~0#1 % 256); 57632#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 57636#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 57624#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 57625#L83-1 assume !(mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256); 58235#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 57651#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 57629#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 57618#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 57619#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 57637#L102-1 [2022-11-25 16:50:47,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1251286282, now seen corresponding path program 1 times [2022-11-25 16:50:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:47,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637548116] [2022-11-25 16:50:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:47,484 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:47,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:47,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1458413444, now seen corresponding path program 2 times [2022-11-25 16:50:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:47,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271495130] [2022-11-25 16:50:47,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:47,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:47,529 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:47,532 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:47,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:47,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1222919909, now seen corresponding path program 2 times [2022-11-25 16:50:47,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:47,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830167068] [2022-11-25 16:50:47,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:47,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:47,797 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 40 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:50:47,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830167068] [2022-11-25 16:50:47,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830167068] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:47,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411612939] [2022-11-25 16:50:47,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:50:47,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:47,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:47,800 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:47,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-11-25 16:50:47,868 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:50:47,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:50:47,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:50:47,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:48,382 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-25 16:50:48,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-11-25 16:50:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411612939] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:48,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:48,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 14 [2022-11-25 16:50:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991875007] [2022-11-25 16:50:48,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:48,691 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:50:48,691 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:50:48,691 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:50:48,691 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:50:48,692 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:50:48,692 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:48,692 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:50:48,692 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:50:48,692 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2022-11-25 16:50:48,692 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:50:48,692 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:50:48,693 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:48,713 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:48,999 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:50:48,999 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:50:48,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:48,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:49,001 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:49,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-11-25 16:50:49,004 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:50:49,004 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:49,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:49,058 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:49,059 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:49,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-11-25 16:50:49,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:50:49,062 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:49,755 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:50:49,759 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-11-25 16:50:49,760 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:50:49,760 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:50:49,760 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:50:49,760 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:50:49,760 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:50:49,760 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:49,760 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:50:49,760 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:50:49,760 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration26_Loop [2022-11-25 16:50:49,760 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:50:49,760 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:50:49,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:49,780 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:50,050 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:50:50,050 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:50:50,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,051 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,066 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,066 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-11-25 16:50:50,077 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,077 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,077 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:50:50,080 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:50:50,080 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,096 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,098 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-11-25 16:50:50,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,100 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,103 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-11-25 16:50:50,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,114 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,114 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,114 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,114 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:50:50,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:50:50,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,118 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-11-25 16:50:50,121 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-25 16:50:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,122 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-11-25 16:50:50,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,135 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,135 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,135 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,135 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:50,139 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:50,139 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,145 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,150 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-11-25 16:50:50,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,162 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,162 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,162 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,162 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,162 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:50,164 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:50,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,168 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,171 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-11-25 16:50:50,171 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-25 16:50:50,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,173 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-11-25 16:50:50,191 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,191 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,192 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:50,196 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:50,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,208 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Ended with exit code 0 [2022-11-25 16:50:50,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,222 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,226 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-11-25 16:50:50,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,237 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,237 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:50,242 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:50,242 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,253 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,256 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-25 16:50:50,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,257 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-11-25 16:50:50,260 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,271 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,271 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,271 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:50,277 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:50,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,285 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,288 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Ended with exit code 0 [2022-11-25 16:50:50,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,290 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,291 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-11-25 16:50:50,292 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:50,302 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,303 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:50,306 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:50,306 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,318 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2022-11-25 16:50:50,321 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-25 16:50:50,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,323 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-11-25 16:50:50,325 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,335 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,336 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:50,336 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,336 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:50,341 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:50,341 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,350 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-11-25 16:50:50,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,355 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,357 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-11-25 16:50:50,368 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,368 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:50,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,368 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:50,370 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:50,370 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,379 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-25 16:50:50,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,380 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-11-25 16:50:50,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,394 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,394 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:50:50,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,394 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:50,401 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:50,401 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,440 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,442 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,460 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,460 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:50:50,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,461 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:50,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-11-25 16:50:50,464 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:50,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,494 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,495 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-25 16:50:50,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,496 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-11-25 16:50:50,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,523 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,524 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:50,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,524 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,524 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,524 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:50,538 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:50,539 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,576 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,577 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,578 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,582 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,596 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,596 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:50,596 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,596 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,596 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,596 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:50,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-11-25 16:50:50,601 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:50,601 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,623 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,632 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-25 16:50:50,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,634 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,651 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,651 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:50,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,651 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,651 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,651 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:50,652 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Waiting until timeout for monitored process [2022-11-25 16:50:50,657 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:50,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,674 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,678 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (54)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,679 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,693 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Waiting until timeout for monitored process [2022-11-25 16:50:50,695 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,695 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:50,695 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,695 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,696 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,696 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:50,698 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:50,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,715 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (55)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,725 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-25 16:50:50,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,726 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,744 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,744 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:50,745 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,745 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,745 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,745 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:50:50,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Waiting until timeout for monitored process [2022-11-25 16:50:50,753 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:50:50,753 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,775 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,785 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (56)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:50,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:50,787 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:50,790 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:50,803 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Waiting until timeout for monitored process [2022-11-25 16:50:50,803 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:50,803 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:50,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:50,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:50,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:50,804 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:50:50,808 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:50:50,808 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:50,827 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:50,830 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (57)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:50,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:50,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 16:50:50,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-11-25 16:50:50,831 INFO L87 Difference]: Start difference. First operand 625 states and 679 transitions. cyclomatic complexity: 60 Second operand has 14 states, 14 states have (on average 10.142857142857142) internal successors, (142), 14 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:51,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:51,725 INFO L93 Difference]: Finished difference Result 527 states and 553 transitions. [2022-11-25 16:50:51,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 527 states and 553 transitions. [2022-11-25 16:50:51,727 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 16:50:51,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 527 states to 182 states and 188 transitions. [2022-11-25 16:50:51,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 182 [2022-11-25 16:50:51,728 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 182 [2022-11-25 16:50:51,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 188 transitions. [2022-11-25 16:50:51,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:51,728 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 188 transitions. [2022-11-25 16:50:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 188 transitions. [2022-11-25 16:50:51,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 108. [2022-11-25 16:50:51,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.0555555555555556) internal successors, (114), 107 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 114 transitions. [2022-11-25 16:50:51,730 INFO L240 hiAutomatonCegarLoop]: Abstraction has 108 states and 114 transitions. [2022-11-25 16:50:51,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 16:50:51,735 INFO L428 stractBuchiCegarLoop]: Abstraction has 108 states and 114 transitions. [2022-11-25 16:50:51,735 INFO L335 stractBuchiCegarLoop]: ======== Iteration 27 ============ [2022-11-25 16:50:51,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 108 states and 114 transitions. [2022-11-25 16:50:51,736 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2022-11-25 16:50:51,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-25 16:50:51,736 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-25 16:50:51,737 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:51,737 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:50:51,737 INFO L748 eck$LassoCheckResult]: Stem: 59269#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); 59260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~ret4#1, main_~a~0#1, main_~b~0#1, main_~r~1#1;havoc main_~a~0#1;havoc main_~b~0#1;havoc main_~r~1#1;main_~b~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;main_~a~0#1 := 234770789;assume { :begin_inline_mp_add } true;mp_add_#in~a#1, mp_add_#in~b#1 := main_~a~0#1, main_~b~0#1;havoc mp_add_#res#1;havoc mp_add_#t~nondet1#1, mp_add_#t~nondet2#1, mp_add_~a#1, mp_add_~b#1, mp_add_~a0~0#1, mp_add_~a1~0#1, mp_add_~a2~0#1, mp_add_~a3~0#1, mp_add_~b0~0#1, mp_add_~b1~0#1, mp_add_~b2~0#1, mp_add_~b3~0#1, mp_add_~r0~0#1, mp_add_~r1~0#1, mp_add_~r2~0#1, mp_add_~r3~0#1, mp_add_~carry~0#1, mp_add_~partial_sum~0#1, mp_add_~r~0#1, mp_add_~i~0#1, mp_add_~na~0#1, mp_add_~nb~0#1;mp_add_~a#1 := mp_add_#in~a#1;mp_add_~b#1 := mp_add_#in~b#1;havoc mp_add_~a0~0#1;havoc mp_add_~a1~0#1;havoc mp_add_~a2~0#1;havoc mp_add_~a3~0#1;havoc mp_add_~b0~0#1;havoc mp_add_~b1~0#1;havoc mp_add_~b2~0#1;havoc mp_add_~b3~0#1;havoc mp_add_~r0~0#1;havoc mp_add_~r1~0#1;havoc mp_add_~r2~0#1;havoc mp_add_~r3~0#1;havoc mp_add_~carry~0#1;havoc mp_add_~partial_sum~0#1;havoc mp_add_~r~0#1;havoc mp_add_~i~0#1;havoc mp_add_~na~0#1;havoc mp_add_~nb~0#1;mp_add_~a0~0#1 := mp_add_~a#1;mp_add_~a1~0#1 := mp_add_~a#1 / 256;mp_add_~a2~0#1 := mp_add_~a#1 / 65536;mp_add_~a3~0#1 := mp_add_~a#1 / 16777216;mp_add_~b0~0#1 := mp_add_~b#1;mp_add_~b1~0#1 := mp_add_~b#1 / 256;mp_add_~b2~0#1 := mp_add_~b#1 / 65536;mp_add_~b3~0#1 := mp_add_~b#1 / 16777216;mp_add_~na~0#1 := 4; 59254#L59 assume !(0 == mp_add_~a3~0#1 % 256); 59255#L59-1 mp_add_~nb~0#1 := 4; 59265#L69 assume 0 == mp_add_~b3~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 59258#L71 assume 0 == mp_add_~b2~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 59259#L73 assume 0 == mp_add_~b1~0#1 % 256;mp_add_~nb~0#1 := mp_add_~nb~0#1 % 256 - 1; 59280#L69-1 mp_add_~carry~0#1 := 0;mp_add_~i~0#1 := 0; 59281#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59325#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59324#L84 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a0~0#1 % 256; 59323#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 59322#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 59321#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 59320#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59319#L90 assume 0 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b0~0#1 % 256; 59317#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59312#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59313#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 59338#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 59336#L95-1 assume 0 == mp_add_~i~0#1 % 256;mp_add_~r0~0#1 := mp_add_~partial_sum~0#1; 59335#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59334#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59333#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 59332#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59331#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59330#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59267#L84 assume !(0 == mp_add_~i~0#1 % 256); 59268#L84-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a1~0#1 % 256; 59272#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 59261#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 59262#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59318#L90 assume !(0 == mp_add_~i~0#1 % 256); 59315#L90-2 assume 1 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b1~0#1 % 256; 59316#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59286#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 59287#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 59346#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 59345#L99-1 assume 1 == mp_add_~i~0#1 % 256;mp_add_~r1~0#1 := mp_add_~partial_sum~0#1; 59344#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59343#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 59342#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59341#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59329#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59328#L84 assume !(0 == mp_add_~i~0#1 % 256); 59327#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 59326#L85-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a2~0#1 % 256; 59314#L86-1 assume !(3 == mp_add_~i~0#1 % 256); 59311#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59310#L90 assume !(0 == mp_add_~i~0#1 % 256); 59309#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59308#L91-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b2~0#1 % 256; 59307#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 59304#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 59302#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 59301#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59300#L100-1 assume 2 == mp_add_~i~0#1 % 256;mp_add_~r2~0#1 := mp_add_~partial_sum~0#1; 59299#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 59298#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59297#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59296#L83 assume mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256; 59295#L84 assume !(0 == mp_add_~i~0#1 % 256); 59294#L84-2 assume !(1 == mp_add_~i~0#1 % 256); 59293#L85-1 assume !(2 == mp_add_~i~0#1 % 256); 59292#L86-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~a3~0#1 % 256; 59291#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59290#L90 assume !(0 == mp_add_~i~0#1 % 256); 59289#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59288#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59285#L92-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~partial_sum~0#1 := mp_add_~partial_sum~0#1 % 65536 + mp_add_~b3~0#1 % 256; 59282#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 59284#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 59357#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59356#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59355#L101-1 assume 3 == mp_add_~i~0#1 % 256;mp_add_~r3~0#1 := mp_add_~partial_sum~0#1; 59273#L102-1 [2022-11-25 16:50:51,737 INFO L750 eck$LassoCheckResult]: Loop: 59273#L102-1 mp_add_~i~0#1 := 1 + mp_add_~i~0#1 % 256; 59270#L80-2 assume !!((mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256 || mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256) || 0 != mp_add_~carry~0#1 % 65536);mp_add_~partial_sum~0#1 := mp_add_~carry~0#1;mp_add_~carry~0#1 := 0; 59271#L83 assume !(mp_add_~i~0#1 % 256 < mp_add_~na~0#1 % 256); 59279#L83-1 assume mp_add_~i~0#1 % 256 < mp_add_~nb~0#1 % 256; 59274#L90 assume !(0 == mp_add_~i~0#1 % 256); 59275#L90-2 assume !(1 == mp_add_~i~0#1 % 256); 59250#L91-1 assume !(2 == mp_add_~i~0#1 % 256); 59251#L92-1 assume !(3 == mp_add_~i~0#1 % 256); 59252#L89 assume !(mp_add_~partial_sum~0#1 % 65536 > 255); 59253#L95-1 assume !(0 == mp_add_~i~0#1 % 256); 59266#L99-1 assume !(1 == mp_add_~i~0#1 % 256); 59256#L100-1 assume !(2 == mp_add_~i~0#1 % 256); 59257#L101-1 assume !(3 == mp_add_~i~0#1 % 256); 59273#L102-1 [2022-11-25 16:50:51,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 883450398, now seen corresponding path program 1 times [2022-11-25 16:50:51,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:51,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061101711] [2022-11-25 16:50:51,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 27 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 16:50:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:50:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061101711] [2022-11-25 16:50:52,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061101711] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 16:50:52,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16759195] [2022-11-25 16:50:52,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:52,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 16:50:52,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:52,251 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 16:50:52,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-11-25 16:50:52,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:50:52,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 16:50:52,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:50:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 70 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 16:50:52,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 16:50:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-11-25 16:50:53,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16759195] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 16:50:53,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 16:50:53,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 9] total 23 [2022-11-25 16:50:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574754319] [2022-11-25 16:50:53,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 16:50:53,329 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-11-25 16:50:53,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:50:53,330 INFO L85 PathProgramCache]: Analyzing trace with hash -447646624, now seen corresponding path program 1 times [2022-11-25 16:50:53,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:50:53,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564112515] [2022-11-25 16:50:53,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:50:53,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:50:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:53,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:50:53,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:50:53,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:50:53,450 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:50:53,450 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:50:53,450 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:50:53,451 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:50:53,451 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-11-25 16:50:53,451 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:53,451 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:50:53,451 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:50:53,451 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2022-11-25 16:50:53,451 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:50:53,451 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:50:53,452 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:53,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:53,750 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:50:53,750 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-11-25 16:50:53,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:53,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:53,751 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:53,754 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-11-25 16:50:53,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Waiting until timeout for monitored process [2022-11-25 16:50:53,754 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:53,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (59)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:53,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:53,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:53,822 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:53,828 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-11-25 16:50:53,829 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-11-25 16:50:53,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Waiting until timeout for monitored process [2022-11-25 16:50:54,920 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-11-25 16:50:54,925 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (60)] Ended with exit code 0 [2022-11-25 16:50:54,926 INFO L210 LassoAnalysis]: Preferences: [2022-11-25 16:50:54,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-11-25 16:50:54,926 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-11-25 16:50:54,926 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-11-25 16:50:54,926 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-11-25 16:50:54,926 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:54,926 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-11-25 16:50:54,926 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-11-25 16:50:54,926 INFO L133 ssoRankerPreferences]: Filename of dumped script: byte_add_1-1.i_Iteration27_Loop [2022-11-25 16:50:54,926 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-11-25 16:50:54,926 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-11-25 16:50:54,927 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:54,958 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-11-25 16:50:55,254 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-11-25 16:50:55,254 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-11-25 16:50:55,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,259 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Waiting until timeout for monitored process [2022-11-25 16:50:55,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,272 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,272 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:50:55,275 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:50:55,275 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,279 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,282 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (61)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,283 INFO L229 MonitoredProcess]: Starting monitored process 62 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Waiting until timeout for monitored process [2022-11-25 16:50:55,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-11-25 16:50:55,297 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-11-25 16:50:55,297 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,300 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,307 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (62)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,307 INFO L490 LassoAnalysis]: Using template '2-nested'. [2022-11-25 16:50:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,309 INFO L229 MonitoredProcess]: Starting monitored process 63 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Waiting until timeout for monitored process [2022-11-25 16:50:55,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,322 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:55,326 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:55,326 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (63)] Ended with exit code 0 [2022-11-25 16:50:55,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,335 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,336 INFO L229 MonitoredProcess]: Starting monitored process 64 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Waiting until timeout for monitored process [2022-11-25 16:50:55,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,350 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,350 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:55,352 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:55,352 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,383 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (64)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,387 INFO L490 LassoAnalysis]: Using template '3-nested'. [2022-11-25 16:50:55,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,388 INFO L229 MonitoredProcess]: Starting monitored process 65 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Waiting until timeout for monitored process [2022-11-25 16:50:55,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,410 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:55,415 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:55,415 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,435 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (65)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,439 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,440 INFO L229 MonitoredProcess]: Starting monitored process 66 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Waiting until timeout for monitored process [2022-11-25 16:50:55,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,461 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,461 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,461 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,461 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:55,463 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:55,464 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,486 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (66)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,487 INFO L490 LassoAnalysis]: Using template '4-nested'. [2022-11-25 16:50:55,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,487 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,488 INFO L229 MonitoredProcess]: Starting monitored process 67 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Waiting until timeout for monitored process [2022-11-25 16:50:55,491 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,505 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,505 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,505 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,505 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,505 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:55,511 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:55,512 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,529 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (67)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,538 INFO L229 MonitoredProcess]: Starting monitored process 68 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,557 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Waiting until timeout for monitored process [2022-11-25 16:50:55,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-11-25 16:50:55,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,558 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:55,561 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:55,561 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,579 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (68)] Ended with exit code 0 [2022-11-25 16:50:55,585 INFO L490 LassoAnalysis]: Using template '2-phase'. [2022-11-25 16:50:55,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,585 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,586 INFO L229 MonitoredProcess]: Starting monitored process 69 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Waiting until timeout for monitored process [2022-11-25 16:50:55,603 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,603 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:55,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,604 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,604 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:55,610 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:55,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,629 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (69)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,636 INFO L229 MonitoredProcess]: Starting monitored process 70 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,640 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Waiting until timeout for monitored process [2022-11-25 16:50:55,654 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,654 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:55,654 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,654 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,654 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,654 INFO L205 nArgumentSynthesizer]: 3 template conjuncts. [2022-11-25 16:50:55,657 INFO L401 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2022-11-25 16:50:55,657 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,683 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (70)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,687 INFO L490 LassoAnalysis]: Using template '3-phase'. [2022-11-25 16:50:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,689 INFO L229 MonitoredProcess]: Starting monitored process 71 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Waiting until timeout for monitored process [2022-11-25 16:50:55,708 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,708 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:50:55,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,708 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:55,715 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:55,715 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,743 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,747 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (71)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,748 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,749 INFO L229 MonitoredProcess]: Starting monitored process 72 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,753 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Waiting until timeout for monitored process [2022-11-25 16:50:55,767 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,767 INFO L338 nArgumentSynthesizer]: Template has degree 2. [2022-11-25 16:50:55,767 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,767 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:55,771 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:55,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,795 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (72)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,799 INFO L490 LassoAnalysis]: Using template '4-phase'. [2022-11-25 16:50:55,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,800 INFO L229 MonitoredProcess]: Starting monitored process 73 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Waiting until timeout for monitored process [2022-11-25 16:50:55,818 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,818 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:55,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,819 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,819 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:55,827 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:55,827 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (73)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,868 INFO L229 MonitoredProcess]: Starting monitored process 74 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Waiting until timeout for monitored process [2022-11-25 16:50:55,885 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,885 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:55,886 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,886 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,886 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,886 INFO L205 nArgumentSynthesizer]: 5 template conjuncts. [2022-11-25 16:50:55,890 INFO L401 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2022-11-25 16:50:55,890 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,905 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (74)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,910 INFO L490 LassoAnalysis]: Using template '2-lex'. [2022-11-25 16:50:55,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,911 INFO L229 MonitoredProcess]: Starting monitored process 75 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,915 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,927 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,928 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:55,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,928 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:55,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Waiting until timeout for monitored process [2022-11-25 16:50:55,933 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:55,934 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,951 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,954 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (75)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:55,956 INFO L229 MonitoredProcess]: Starting monitored process 76 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:55,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:55,972 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:55,972 INFO L338 nArgumentSynthesizer]: Template has degree 1. [2022-11-25 16:50:55,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:55,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:55,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:55,973 INFO L205 nArgumentSynthesizer]: 4 template conjuncts. [2022-11-25 16:50:55,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Waiting until timeout for monitored process [2022-11-25 16:50:55,976 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-11-25 16:50:55,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:55,995 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:55,998 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (76)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:55,999 INFO L490 LassoAnalysis]: Using template '3-lex'. [2022-11-25 16:50:55,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:55,999 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:56,000 INFO L229 MonitoredProcess]: Starting monitored process 77 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:56,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:56,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Waiting until timeout for monitored process [2022-11-25 16:50:56,017 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:56,017 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:56,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:56,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:56,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:56,017 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:50:56,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:50:56,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:56,047 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:56,051 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (77)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:56,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-25 16:50:56,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:50:56,052 INFO L229 MonitoredProcess]: Starting monitored process 78 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-25 16:50:56,056 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-11-25 16:50:56,068 WARN L333 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2022-11-25 16:50:56,069 INFO L338 nArgumentSynthesizer]: Template has degree 3. [2022-11-25 16:50:56,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-11-25 16:50:56,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-11-25 16:50:56,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-11-25 16:50:56,069 INFO L205 nArgumentSynthesizer]: 6 template conjuncts. [2022-11-25 16:50:56,070 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Waiting until timeout for monitored process [2022-11-25 16:50:56,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-11-25 16:50:56,073 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-11-25 16:50:56,095 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-11-25 16:50:56,098 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (78)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:56,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:50:56,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 16:50:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-11-25 16:50:56,100 INFO L87 Difference]: Start difference. First operand 108 states and 114 transitions. cyclomatic complexity: 7 Second operand has 23 states, 23 states have (on average 6.913043478260869) internal successors, (159), 23 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:50:56,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:50:56,607 INFO L93 Difference]: Finished difference Result 83 states and 85 transitions. [2022-11-25 16:50:56,607 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 83 states and 85 transitions. [2022-11-25 16:50:56,608 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-25 16:50:56,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 83 states to 0 states and 0 transitions. [2022-11-25 16:50:56,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-11-25 16:50:56,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-11-25 16:50:56,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-11-25 16:50:56,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:50:56,608 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:50:56,608 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:50:56,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 16:50:56,609 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:50:56,609 INFO L335 stractBuchiCegarLoop]: ======== Iteration 28 ============ [2022-11-25 16:50:56,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:50:56,610 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-11-25 16:50:56,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-11-25 16:50:56,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 25.11 04:50:56 BoogieIcfgContainer [2022-11-25 16:50:56,618 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-25 16:50:56,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:50:56,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:50:56,619 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:50:56,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:50:17" (3/4) ... [2022-11-25 16:50:56,622 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:50:56,622 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:50:56,623 INFO L158 Benchmark]: Toolchain (without parser) took 40023.20ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 143.4MB in the beginning and 206.3MB in the end (delta: -63.0MB). Peak memory consumption was 126.6MB. Max. memory is 16.1GB. [2022-11-25 16:50:56,623 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:50:56,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.78ms. Allocated memory is still 174.1MB. Free memory was 143.4MB in the beginning and 130.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 16:50:56,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.46ms. Allocated memory is still 174.1MB. Free memory was 130.8MB in the beginning and 128.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:50:56,624 INFO L158 Benchmark]: Boogie Preprocessor took 36.23ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 126.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:50:56,624 INFO L158 Benchmark]: RCFGBuilder took 750.84ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 105.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2022-11-25 16:50:56,625 INFO L158 Benchmark]: BuchiAutomizer took 38847.27ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 105.7MB in the beginning and 207.4MB in the end (delta: -101.6MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. [2022-11-25 16:50:56,625 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 362.8MB. Free memory was 207.4MB in the beginning and 206.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:50:56,627 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 125.8MB. Free memory is still 80.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.78ms. Allocated memory is still 174.1MB. Free memory was 143.4MB in the beginning and 130.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.46ms. Allocated memory is still 174.1MB. Free memory was 130.8MB in the beginning and 128.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.23ms. Allocated memory is still 174.1MB. Free memory was 127.5MB in the beginning and 126.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 750.84ms. Allocated memory is still 174.1MB. Free memory was 126.1MB in the beginning and 105.7MB in the end (delta: 20.3MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 38847.27ms. Allocated memory was 174.1MB in the beginning and 362.8MB in the end (delta: 188.7MB). Free memory was 105.7MB in the beginning and 207.4MB in the end (delta: -101.6MB). Peak memory consumption was 88.8MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 362.8MB. Free memory was 207.4MB in the beginning and 206.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 23 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 38.7s and 28 iterations. TraceHistogramMax:7. Analysis of lassos took 21.1s. Construction of modules took 9.3s. Büchi inclusion checks took 7.9s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 9188 StatesRemovedByMinimization, 25 NontrivialMinimizations. Non-live state removal took 0.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6085 SdHoareTripleChecker+Valid, 11.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6085 mSDsluCounter, 5211 SdHoareTripleChecker+Invalid, 9.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3537 mSDsCounter, 734 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8629 IncrementalHoareTripleChecker+Invalid, 9363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 734 mSolverCounterUnsat, 1674 mSDtfsCounter, 8629 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI18 SFLT0 conc1 concLT0 SILN0 SILU2 SILI6 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital60 mio100 ax100 hnf100 lsp80 ukn100 mio100 lsp100 div387 bol100 ite100 ukn100 eq146 hnf96 smp34 dnf100 smp100 tf102 neg97 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 51ms VariablesStem: 0 VariablesLoop: 12 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.7s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-11-25 16:50:56,651 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:56,856 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-11-25 16:50:57,056 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-11-25 16:50:57,256 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:57,456 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:57,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-11-25 16:50:57,856 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:58,057 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:58,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:58,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:58,658 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:58,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:59,058 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:50:59,258 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 16:50:59,458 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 16:50:59,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-25 16:50:59,859 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bd1afaa0-d402-4459-bc0a-0433e53ecd93/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE