./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/ldv-regression/ex3_forlist.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8 --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 ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e --- 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-2329fc7 [2022-12-13 14:16:41,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:16:41,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:16:41,269 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:16:41,270 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:16:41,271 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:16:41,273 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:16:41,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:16:41,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:16:41,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:16:41,281 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:16:41,282 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:16:41,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:16:41,285 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:16:41,286 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:16:41,288 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:16:41,289 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:16:41,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:16:41,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:16:41,296 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:16:41,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:16:41,300 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:16:41,301 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:16:41,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:16:41,309 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:16:41,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:16:41,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:16:41,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:16:41,312 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:16:41,313 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:16:41,314 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:16:41,315 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:16:41,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:16:41,316 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:16:41,317 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:16:41,317 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:16:41,318 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:16:41,318 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:16:41,318 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:16:41,319 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:16:41,320 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:16:41,321 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 14:16:41,345 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:16:41,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:16:41,346 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:16:41,346 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:16:41,347 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:16:41,347 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:16:41,347 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:16:41,348 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 14:16:41,348 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 14:16:41,348 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 14:16:41,348 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 14:16:41,348 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 14:16:41,348 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 14:16:41,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:16:41,349 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:16:41,349 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:16:41,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:16:41,349 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:16:41,349 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:16:41,349 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 14:16:41,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 14:16:41,350 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 14:16:41,350 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:16:41,350 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 14:16:41,350 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 14:16:41,351 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:16:41,351 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 14:16:41,351 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:16:41,351 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:16:41,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:16:41,352 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:16:41,352 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 14:16:41,353 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_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/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_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8 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 -> ddbd4e73adf4663f87721f5aa250c32f7b058621a618ab1d03544a940de1ce0e [2022-12-13 14:16:41,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:16:41,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:16:41,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:16:41,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:16:41,539 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:16:41,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-12-13 14:16:44,235 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:16:44,409 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:16:44,414 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/sv-benchmarks/c/ldv-regression/ex3_forlist.i [2022-12-13 14:16:44,420 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/data/b2cb91cca/39b2ed8d68654c8d8a89aeeabf471a29/FLAG45b175975 [2022-12-13 14:16:44,432 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/data/b2cb91cca/39b2ed8d68654c8d8a89aeeabf471a29 [2022-12-13 14:16:44,434 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:16:44,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:16:44,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:16:44,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:16:44,439 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:16:44,440 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9dbe9f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44, skipping insertion in model container [2022-12-13 14:16:44,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:16:44,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:16:44,558 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_4fe8879b-1e53-4f89-8c51-245c67911f79/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-12-13 14:16:44,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:16:44,592 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:16:44,602 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_4fe8879b-1e53-4f89-8c51-245c67911f79/sv-benchmarks/c/ldv-regression/ex3_forlist.i[293,306] [2022-12-13 14:16:44,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:16:44,625 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:16:44,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44 WrapperNode [2022-12-13 14:16:44,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:16:44,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:16:44,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:16:44,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:16:44,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,664 INFO L138 Inliner]: procedures = 19, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 138 [2022-12-13 14:16:44,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:16:44,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:16:44,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:16:44,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:16:44,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,675 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,679 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,683 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,686 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:16:44,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:16:44,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:16:44,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:16:44,687 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (1/1) ... [2022-12-13 14:16:44,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:44,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:44,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:44,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 14:16:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 14:16:44,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 14:16:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:16:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:16:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 14:16:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:16:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:16:44,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:16:44,747 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 14:16:44,812 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:16:44,814 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:16:45,035 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:16:45,041 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:16:45,041 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-13 14:16:45,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:16:45 BoogieIcfgContainer [2022-12-13 14:16:45,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:16:45,044 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 14:16:45,044 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 14:16:45,048 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 14:16:45,048 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 14:16:45,048 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 02:16:44" (1/3) ... [2022-12-13 14:16:45,049 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26e80c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 02:16:45, skipping insertion in model container [2022-12-13 14:16:45,049 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 14:16:45,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:16:44" (2/3) ... [2022-12-13 14:16:45,050 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@26e80c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 02:16:45, skipping insertion in model container [2022-12-13 14:16:45,050 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 14:16:45,050 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:16:45" (3/3) ... [2022-12-13 14:16:45,051 INFO L332 chiAutomizerObserver]: Analyzing ICFG ex3_forlist.i [2022-12-13 14:16:45,094 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 14:16:45,094 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 14:16:45,094 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 14:16:45,094 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 14:16:45,094 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 14:16:45,095 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 14:16:45,095 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 14:16:45,095 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 14:16:45,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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-12-13 14:16:45,111 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2022-12-13 14:16:45,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:16:45,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:16:45,114 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:16:45,114 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 14:16:45,115 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 14:16:45,115 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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-12-13 14:16:45,117 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 22 [2022-12-13 14:16:45,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:16:45,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:16:45,118 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 14:16:45,118 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 14:16:45,123 INFO L748 eck$LassoCheckResult]: Stem: 31#$Ultimate##0true 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 35#L19-3true [2022-12-13 14:16:45,124 INFO L750 eck$LassoCheckResult]: Loop: 35#L19-3true assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2#L19-2true init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 35#L19-3true [2022-12-13 14:16:45,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:45,128 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 14:16:45,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:45,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452473287] [2022-12-13 14:16:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:45,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:45,217 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:45,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:45,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:45,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2022-12-13 14:16:45,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:45,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668185174] [2022-12-13 14:16:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:45,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:45,274 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:45,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2022-12-13 14:16:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:45,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651673558] [2022-12-13 14:16:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:45,325 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:45,350 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:45,821 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 14:16:45,822 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 14:16:45,822 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 14:16:45,822 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 14:16:45,822 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 14:16:45,822 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:45,823 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 14:16:45,823 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 14:16:45,823 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration1_Lasso [2022-12-13 14:16:45,823 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 14:16:45,823 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 14:16:45,841 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:45,848 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:45,850 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:45,854 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,280 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,282 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,284 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,286 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,288 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,289 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,292 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,293 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,295 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,297 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,300 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:16:46,584 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 14:16:46,588 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 14:16:46,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,590 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 14:16:46,593 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-12-13 14:16:46,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 14:16:46,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,607 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 14:16:46,607 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 14:16:46,609 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,613 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 14:16:46,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 14:16:46,617 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-12-13 14:16:46,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 14:16:46,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 14:16:46,630 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 14:16:46,631 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-12-13 14:16:46,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 14:16:46,637 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-12-13 14:16:46,648 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,648 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,648 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,648 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,651 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,651 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,654 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,657 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 14:16:46,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,658 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 14:16:46,660 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-12-13 14:16:46,670 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,670 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,670 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,670 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,672 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,673 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,676 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 14:16:46,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,680 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 14:16:46,682 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-12-13 14:16:46,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,698 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,701 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-12-13 14:16:46,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,702 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 14:16:46,704 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-12-13 14:16:46,714 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,714 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,714 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,714 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,716 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,716 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,720 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,722 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 14:16:46,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,723 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 14:16:46,726 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-12-13 14:16:46,736 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,736 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,736 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,736 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,738 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,738 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,742 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,745 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 14:16:46,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,746 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 14:16:46,748 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-12-13 14:16:46,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,763 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-12-13 14:16:46,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,767 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 14:16:46,769 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-12-13 14:16:46,781 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,782 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,782 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,782 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,783 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,790 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2022-12-13 14:16:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,791 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 14:16:46,794 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-12-13 14:16:46,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-12-13 14:16:46,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 14:16:46,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-12-13 14:16:46,827 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,827 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,830 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,834 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,837 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-12-13 14:16:46,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,838 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 14:16:46,841 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-12-13 14:16:46,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,851 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,851 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,851 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,853 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,854 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,858 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,861 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 14:16:46,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,862 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 14:16:46,864 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-12-13 14:16:46,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,877 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,877 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,880 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:16:46,883 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 14:16:46,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:46,884 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:46,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 14:16:46,886 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-12-13 14:16:46,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:16:46,897 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:16:46,897 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:16:46,897 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:16:46,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:16:46,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:16:46,917 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 14:16:46,981 INFO L443 ModelExtractionUtils]: Simplification made 26 calls to the SMT solver. [2022-12-13 14:16:46,981 INFO L444 ModelExtractionUtils]: 0 out of 25 variables were initially zero. Simplification set additionally 22 variables to zero. [2022-12-13 14:16:46,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:16:46,983 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:47,019 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:16:47,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 14:16:47,021 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 14:16:47,033 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 14:16:47,033 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 14:16:47,033 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_~i~0#1) = -2*ULTIMATE.start_init_~i~0#1 + 3 Supporting invariants [] [2022-12-13 14:16:47,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-12-13 14:16:47,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-12-13 14:16:47,113 INFO L156 tatePredicateManager]: 21 out of 21 supporting invariants were superfluous and have been removed [2022-12-13 14:16:47,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:47,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:16:47,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:16:47,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:47,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 14:16:47,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:16:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:47,204 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 14:16:47,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12-13 14:16:47,250 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 35 states, 34 states have (on average 1.5) internal successors, (51), 34 states have internal predecessors, (51), 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 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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) Result 95 states and 138 transitions. Complement of second has 7 states. [2022-12-13 14:16:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 14:16:47,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 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-12-13 14:16:47,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 94 transitions. [2022-12-13 14:16:47,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 2 letters. [2022-12-13 14:16:47,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 14:16:47,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 4 letters. Loop has 2 letters. [2022-12-13 14:16:47,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 14:16:47,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 94 transitions. Stem has 2 letters. Loop has 4 letters. [2022-12-13 14:16:47,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 14:16:47,258 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 138 transitions. [2022-12-13 14:16:47,260 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 14:16:47,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 28 states and 37 transitions. [2022-12-13 14:16:47,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-12-13 14:16:47,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-12-13 14:16:47,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 37 transitions. [2022-12-13 14:16:47,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:16:47,264 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-12-13 14:16:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 37 transitions. [2022-12-13 14:16:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-13 14:16:47,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 27 states have internal predecessors, (37), 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-12-13 14:16:47,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2022-12-13 14:16:47,284 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-12-13 14:16:47,284 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2022-12-13 14:16:47,284 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 14:16:47,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2022-12-13 14:16:47,284 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 14:16:47,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:16:47,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:16:47,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:16:47,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:16:47,285 INFO L748 eck$LassoCheckResult]: Stem: 279#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 260#L19-3 assume !(init_~i~0#1 < 2); 276#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 272#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 273#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 257#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 258#L27-3 [2022-12-13 14:16:47,285 INFO L750 eck$LassoCheckResult]: Loop: 258#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 278#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 263#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 258#L27-3 [2022-12-13 14:16:47,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1807951404, now seen corresponding path program 1 times [2022-12-13 14:16:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577601788] [2022-12-13 14:16:47,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:16:47,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577601788] [2022-12-13 14:16:47,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577601788] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:16:47,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:16:47,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:16:47,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234446704] [2022-12-13 14:16:47,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:16:47,334 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 14:16:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 1 times [2022-12-13 14:16:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326671721] [2022-12-13 14:16:47,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,339 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:47,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:16:47,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:16:47,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:16:47,387 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 14 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-12-13 14:16:47,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:16:47,399 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-12-13 14:16:47,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 37 transitions. [2022-12-13 14:16:47,400 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 14:16:47,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 37 transitions. [2022-12-13 14:16:47,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-12-13 14:16:47,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-12-13 14:16:47,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2022-12-13 14:16:47,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:16:47,401 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-12-13 14:16:47,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2022-12-13 14:16:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-12-13 14:16:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 27 states have internal predecessors, (36), 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-12-13 14:16:47,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-12-13 14:16:47,404 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-12-13 14:16:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:16:47,405 INFO L428 stractBuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-12-13 14:16:47,405 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 14:16:47,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2022-12-13 14:16:47,406 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 14:16:47,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:16:47,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:16:47,406 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:16:47,406 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:16:47,407 INFO L748 eck$LassoCheckResult]: Stem: 342#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 323#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 315#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 316#L19-3 assume !(init_~i~0#1 < 2); 339#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 335#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 336#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 317#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 318#L27-3 [2022-12-13 14:16:47,407 INFO L750 eck$LassoCheckResult]: Loop: 318#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 341#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 326#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 318#L27-3 [2022-12-13 14:16:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash -369325334, now seen corresponding path program 1 times [2022-12-13 14:16:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087803529] [2022-12-13 14:16:47,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:47,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:16:47,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087803529] [2022-12-13 14:16:47,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087803529] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:16:47,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597649914] [2022-12-13 14:16:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:16:47,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:47,462 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:16:47,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 14:16:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:47,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:16:47,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:16:47,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:47,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:16:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:47,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597649914] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:16:47,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:16:47,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 14:16:47,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227870891] [2022-12-13 14:16:47,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:16:47,542 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 14:16:47,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 2 times [2022-12-13 14:16:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935152032] [2022-12-13 14:16:47,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,547 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,552 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:47,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:16:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:16:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:16:47,592 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 13 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-12-13 14:16:47,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:16:47,612 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-12-13 14:16:47,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2022-12-13 14:16:47,613 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 14:16:47,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2022-12-13 14:16:47,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2022-12-13 14:16:47,614 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2022-12-13 14:16:47,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2022-12-13 14:16:47,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:16:47,614 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-12-13 14:16:47,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2022-12-13 14:16:47,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-12-13 14:16:47,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 29 states have internal predecessors, (38), 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-12-13 14:16:47,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-12-13 14:16:47,617 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-12-13 14:16:47,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:16:47,618 INFO L428 stractBuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-12-13 14:16:47,618 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 14:16:47,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2022-12-13 14:16:47,619 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2022-12-13 14:16:47,619 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:16:47,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:16:47,620 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:16:47,620 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:16:47,620 INFO L748 eck$LassoCheckResult]: Stem: 456#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 436#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 437#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 457#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 458#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 429#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 430#L19-3 assume !(init_~i~0#1 < 2); 453#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 449#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 450#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 431#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 432#L27-3 [2022-12-13 14:16:47,620 INFO L750 eck$LassoCheckResult]: Loop: 432#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 455#L28 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 440#L27-2 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 432#L27-3 [2022-12-13 14:16:47,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1083197400, now seen corresponding path program 2 times [2022-12-13 14:16:47,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573339508] [2022-12-13 14:16:47,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:47,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:47,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,675 INFO L85 PathProgramCache]: Analyzing trace with hash 62722, now seen corresponding path program 3 times [2022-12-13 14:16:47,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832236452] [2022-12-13 14:16:47,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,680 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:47,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:47,685 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:47,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:47,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415621, now seen corresponding path program 1 times [2022-12-13 14:16:47,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:47,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502914629] [2022-12-13 14:16:47,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:16:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502914629] [2022-12-13 14:16:48,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502914629] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:16:48,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [663691528] [2022-12-13 14:16:48,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:48,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:16:48,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:16:48,266 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:16:48,267 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 14:16:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:16:48,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 14:16:48,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:16:48,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-13 14:16:48,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:16:48,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 14:16:48,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-12-13 14:16:48,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:16:48,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 14:16:48,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:16:48,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 14:16:48,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:16:48,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 14:16:48,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:16:48,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:16:48,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:16:48,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:16:48,594 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:16:48,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:16:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:16:48,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:16:48,675 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_init_~i~0#1|)))) (and (forall ((v_ArrVal_187 Int) (v_ArrVal_188 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0 v_ArrVal_187)) |c_~#pstate~0.base| v_ArrVal_188) |c_~#pp~0.base|) |c_~#pp~0.offset|))) (forall ((v_ArrVal_186 (Array Int Int)) (v_ArrVal_183 Int)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0 v_ArrVal_183)) |c_~#pstate~0.base| v_ArrVal_186) |c_~#pp~0.base|) |c_~#pp~0.offset|) 0)))) is different from false [2022-12-13 14:16:48,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:16:48,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-12-13 14:16:48,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2022-12-13 14:16:48,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2022-12-13 14:16:48,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:16:48,866 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 55 [2022-12-13 14:16:48,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 76 [2022-12-13 14:16:48,910 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:16:48,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2022-12-13 14:16:48,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-12-13 14:16:48,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [663691528] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:16:48,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:16:48,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-12-13 14:16:48,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582818708] [2022-12-13 14:16:48,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:16:48,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:16:48,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-13 14:16:48,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=325, Unknown=2, NotChecked=38, Total=462 [2022-12-13 14:16:48,982 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. cyclomatic complexity: 13 Second operand has 22 states, 22 states have (on average 1.7727272727272727) internal successors, (39), 21 states have internal predecessors, (39), 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-12-13 14:16:49,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:16:49,207 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-12-13 14:16:49,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 35 transitions. [2022-12-13 14:16:49,208 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-12-13 14:16:49,208 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 35 transitions. [2022-12-13 14:16:49,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2022-12-13 14:16:49,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2022-12-13 14:16:49,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 35 transitions. [2022-12-13 14:16:49,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:16:49,209 INFO L218 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-12-13 14:16:49,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 35 transitions. [2022-12-13 14:16:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-13 14:16:49,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.206896551724138) internal successors, (35), 28 states have internal predecessors, (35), 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-12-13 14:16:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-12-13 14:16:49,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-12-13 14:16:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 14:16:49,211 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-12-13 14:16:49,212 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 14:16:49,212 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2022-12-13 14:16:49,212 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-12-13 14:16:49,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:16:49,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:16:49,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:16:49,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:16:49,213 INFO L748 eck$LassoCheckResult]: Stem: 626#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 609#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 610#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 627#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 628#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 600#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 601#L19-3 assume !(init_~i~0#1 < 2); 623#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 619#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 620#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 602#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 603#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 625#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 621#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 618#L27-7 [2022-12-13 14:16:49,213 INFO L750 eck$LassoCheckResult]: Loop: 618#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 611#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 613#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 618#L27-7 [2022-12-13 14:16:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1444415679, now seen corresponding path program 1 times [2022-12-13 14:16:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:49,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486839200] [2022-12-13 14:16:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:49,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:49,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:49,262 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:49,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:49,263 INFO L85 PathProgramCache]: Analyzing trace with hash 81589, now seen corresponding path program 1 times [2022-12-13 14:16:49,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:49,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368002610] [2022-12-13 14:16:49,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:49,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:49,266 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:49,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:16:49,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:16:49,270 INFO L85 PathProgramCache]: Analyzing trace with hash 689897333, now seen corresponding path program 1 times [2022-12-13 14:16:49,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:16:49,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712413021] [2022-12-13 14:16:49,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:16:49,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:16:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:49,299 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:16:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:16:49,321 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:09,706 WARN L233 SmtUtils]: Spent 20.34s on a formula simplification. DAG size of input: 286 DAG size of output: 244 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 14:17:11,575 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 14:17:11,575 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 14:17:11,575 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 14:17:11,575 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 14:17:11,575 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 14:17:11,576 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:11,576 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 14:17:11,576 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 14:17:11,576 INFO L133 ssoRankerPreferences]: Filename of dumped script: ex3_forlist.i_Iteration5_Lasso [2022-12-13 14:17:11,576 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 14:17:11,576 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 14:17:11,578 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,580 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,582 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,583 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,587 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,588 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,590 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:11,591 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,641 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,643 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,644 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,645 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,646 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,647 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,650 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:12,651 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 14:17:13,109 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 14:17:13,109 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 14:17:13,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,110 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 14:17:13,112 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-12-13 14:17:13,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:17:13,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:17:13,126 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,128 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:13,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,129 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 14:17:13,132 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-12-13 14:17:13,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 14:17:13,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,142 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 14:17:13,142 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 14:17:13,144 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,146 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 14:17:13,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,147 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 14:17:13,149 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-12-13 14:17:13,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,160 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 14:17:13,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,161 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 14:17:13,161 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 14:17:13,162 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-12-13 14:17:13,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,165 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 14:17:13,168 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-12-13 14:17:13,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,178 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,178 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,180 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:17:13,180 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:17:13,186 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,188 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-12-13 14:17:13,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,189 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,189 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 14:17:13,191 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-12-13 14:17:13,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,201 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 14:17:13,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,202 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 14:17:13,202 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 14:17:13,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,206 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-12-13 14:17:13,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,207 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-12-13 14:17:13,209 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-12-13 14:17:13,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:17:13,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:17:13,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-12-13 14:17:13,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,227 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 14:17:13,230 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-12-13 14:17:13,240 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,240 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 14:17:13,240 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,240 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,240 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,241 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 14:17:13,241 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 14:17:13,242 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:13,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,245 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,245 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 14:17:13,247 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-12-13 14:17:13,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:17:13,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:17:13,262 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 14:17:13,265 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:13,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,265 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,266 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 14:17:13,268 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-12-13 14:17:13,278 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 14:17:13,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 14:17:13,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 14:17:13,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 14:17:13,282 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 14:17:13,282 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 14:17:13,293 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 14:17:13,310 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2022-12-13 14:17:13,310 INFO L444 ModelExtractionUtils]: 2 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. [2022-12-13 14:17:13,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 14:17:13,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:13,311 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 14:17:13,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 14:17:13,313 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 14:17:13,324 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 14:17:13,324 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 14:17:13,324 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_f_~i~1#1) = -2*ULTIMATE.start_f_~i~1#1 + 3 Supporting invariants [] [2022-12-13 14:17:13,327 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-12-13 14:17:13,461 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-12-13 14:17:13,483 INFO L156 tatePredicateManager]: 39 out of 39 supporting invariants were superfluous and have been removed [2022-12-13 14:17:13,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:13,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:13,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 14:17:13,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:13,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 14:17:13,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:13,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:17:13,548 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-12-13 14:17:13,548 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-13 14:17:13,565 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 35 transitions. cyclomatic complexity: 10. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Result 68 states and 88 transitions. Complement of second has 6 states. [2022-12-13 14:17:13,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-12-13 14:17:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-12-13 14:17:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-12-13 14:17:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 3 letters. [2022-12-13 14:17:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 14:17:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 17 letters. Loop has 3 letters. [2022-12-13 14:17:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 14:17:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 14 letters. Loop has 6 letters. [2022-12-13 14:17:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 14:17:13,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2022-12-13 14:17:13,569 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-12-13 14:17:13,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 43 states and 54 transitions. [2022-12-13 14:17:13,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2022-12-13 14:17:13,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-12-13 14:17:13,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2022-12-13 14:17:13,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 14:17:13,571 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-12-13 14:17:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2022-12-13 14:17:13,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2022-12-13 14:17:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 30 states have internal predecessors, (39), 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-12-13 14:17:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-12-13 14:17:13,572 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-12-13 14:17:13,572 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-12-13 14:17:13,572 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 14:17:13,573 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 39 transitions. [2022-12-13 14:17:13,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-12-13 14:17:13,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:13,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:13,573 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:13,574 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:17:13,574 INFO L748 eck$LassoCheckResult]: Stem: 954#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 933#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 934#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 926#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 927#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 955#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 956#L19-3 assume !(init_~i~0#1 < 2); 951#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 946#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 947#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 928#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 929#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 953#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 948#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 949#L27-7 assume !(f_~i~1#1 < 2); 938#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 930#L38-3 [2022-12-13 14:17:13,574 INFO L750 eck$LassoCheckResult]: Loop: 930#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 932#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 943#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 930#L38-3 [2022-12-13 14:17:13,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:13,574 INFO L85 PathProgramCache]: Analyzing trace with hash -809029298, now seen corresponding path program 1 times [2022-12-13 14:17:13,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:13,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398061565] [2022-12-13 14:17:13,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:13,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:13,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:13,613 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:13,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:13,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398061565] [2022-12-13 14:17:13,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398061565] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:17:13,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:17:13,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:17:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495516199] [2022-12-13 14:17:13,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:17:13,614 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 14:17:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 1 times [2022-12-13 14:17:13,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:13,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290638890] [2022-12-13 14:17:13,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:13,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:13,618 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:13,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:13,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:13,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:13,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:17:13,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:17:13,660 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. cyclomatic complexity: 12 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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-12-13 14:17:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:13,676 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-12-13 14:17:13,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-12-13 14:17:13,677 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-12-13 14:17:13,677 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-12-13 14:17:13,677 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2022-12-13 14:17:13,678 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2022-12-13 14:17:13,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-12-13 14:17:13,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 14:17:13,678 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-12-13 14:17:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-12-13 14:17:13,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-12-13 14:17:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 30 states have internal predecessors, (38), 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-12-13 14:17:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-12-13 14:17:13,680 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-12-13 14:17:13,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:17:13,681 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-12-13 14:17:13,681 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 14:17:13,682 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 38 transitions. [2022-12-13 14:17:13,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-12-13 14:17:13,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:13,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:13,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:13,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:17:13,683 INFO L748 eck$LassoCheckResult]: Stem: 1037#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1016#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1017#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1009#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1010#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1038#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1039#L19-3 assume !(init_~i~0#1 < 2); 1034#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1029#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1030#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1011#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1012#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1036#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1031#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1032#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1020#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1021#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1013#L38-3 [2022-12-13 14:17:13,683 INFO L750 eck$LassoCheckResult]: Loop: 1013#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1015#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1026#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1013#L38-3 [2022-12-13 14:17:13,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:13,683 INFO L85 PathProgramCache]: Analyzing trace with hash 689897275, now seen corresponding path program 1 times [2022-12-13 14:17:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:13,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621515510] [2022-12-13 14:17:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:14,123 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:14,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:14,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621515510] [2022-12-13 14:17:14,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621515510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:17:14,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:17:14,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 14:17:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107272443] [2022-12-13 14:17:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:17:14,124 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 14:17:14,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:14,124 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 2 times [2022-12-13 14:17:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:14,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947254809] [2022-12-13 14:17:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:14,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:17:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:17:14,171 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. cyclomatic complexity: 11 Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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-12-13 14:17:14,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:14,357 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-12-13 14:17:14,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 55 transitions. [2022-12-13 14:17:14,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-12-13 14:17:14,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 45 states and 54 transitions. [2022-12-13 14:17:14,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-12-13 14:17:14,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-12-13 14:17:14,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2022-12-13 14:17:14,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 14:17:14,359 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-12-13 14:17:14,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2022-12-13 14:17:14,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-12-13 14:17:14,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 30 states have internal predecessors, (37), 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-12-13 14:17:14,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-12-13 14:17:14,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 14:17:14,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 14:17:14,363 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-12-13 14:17:14,363 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 14:17:14,363 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2022-12-13 14:17:14,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-12-13 14:17:14,364 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:14,364 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:14,365 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:14,365 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:17:14,365 INFO L748 eck$LassoCheckResult]: Stem: 1134#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1115#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1116#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1106#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1107#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1135#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1136#L19-3 assume !(init_~i~0#1 < 2); 1131#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1126#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1127#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1108#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1109#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1133#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1128#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1129#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1119#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1120#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1125#L27-7 assume !(f_~i~1#1 < 2); 1118#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1110#L38-3 [2022-12-13 14:17:14,365 INFO L750 eck$LassoCheckResult]: Loop: 1110#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1112#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1123#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1110#L38-3 [2022-12-13 14:17:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1566375042, now seen corresponding path program 1 times [2022-12-13 14:17:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:14,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340563157] [2022-12-13 14:17:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:14,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340563157] [2022-12-13 14:17:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340563157] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:17:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387081010] [2022-12-13 14:17:14,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:17:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:14,415 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:17:14,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 14:17:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:14,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 14:17:14,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:14,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:14,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:17:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:14,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387081010] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:17:14,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:17:14,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-12-13 14:17:14,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793747240] [2022-12-13 14:17:14,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:17:14,514 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 14:17:14,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 3 times [2022-12-13 14:17:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:14,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176097871] [2022-12-13 14:17:14,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:17:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:17:14,562 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 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-12-13 14:17:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:14,584 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-12-13 14:17:14,584 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 56 transitions. [2022-12-13 14:17:14,584 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 20 [2022-12-13 14:17:14,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 56 transitions. [2022-12-13 14:17:14,585 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2022-12-13 14:17:14,585 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2022-12-13 14:17:14,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 56 transitions. [2022-12-13 14:17:14,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 14:17:14,586 INFO L218 hiAutomatonCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-12-13 14:17:14,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 56 transitions. [2022-12-13 14:17:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2022-12-13 14:17:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 33 states have internal predecessors, (41), 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-12-13 14:17:14,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-12-13 14:17:14,589 INFO L240 hiAutomatonCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-12-13 14:17:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:17:14,589 INFO L428 stractBuchiCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-12-13 14:17:14,589 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 14:17:14,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 41 transitions. [2022-12-13 14:17:14,590 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-12-13 14:17:14,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:14,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:14,590 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:14,590 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:17:14,590 INFO L748 eck$LassoCheckResult]: Stem: 1327#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1309#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1299#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1300#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1330#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1331#L19-3 assume !(init_~i~0#1 < 2); 1324#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1319#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1320#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1304#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1305#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1326#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1321#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1322#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1328#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1332#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1329#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1310#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1311#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1301#L38-3 [2022-12-13 14:17:14,590 INFO L750 eck$LassoCheckResult]: Loop: 1301#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1303#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 1316#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1301#L38-3 [2022-12-13 14:17:14,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:14,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1312987783, now seen corresponding path program 1 times [2022-12-13 14:17:14,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:14,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132652512] [2022-12-13 14:17:14,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,612 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:14,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 100808, now seen corresponding path program 4 times [2022-12-13 14:17:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:14,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379289935] [2022-12-13 14:17:14,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:14,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,629 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:14,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:14,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 951949698, now seen corresponding path program 1 times [2022-12-13 14:17:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:14,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135392152] [2022-12-13 14:17:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:15,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:15,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135392152] [2022-12-13 14:17:15,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135392152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:17:15,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618585282] [2022-12-13 14:17:15,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:15,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:17:15,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:15,434 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:17:15,435 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 14:17:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:15,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 14:17:15,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:15,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 14:17:15,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:15,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:17:15,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-13 14:17:15,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:15,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:17:15,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:15,846 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 14:17:15,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:15,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 14:17:15,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:15,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:17:15,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:15,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 14:17:15,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:17:15,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 14:17:15,961 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:15,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:17:16,026 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_f_~i~1#1|)))) (and (forall ((v_ArrVal_740 (Array Int Int)) (v_ArrVal_743 Int)) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0 v_ArrVal_743)) |c_~#pstate~0.base| v_ArrVal_740) |c_~#pp~0.base|) |c_~#pp~0.offset|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((v_ArrVal_742 Int) (v_ArrVal_739 (Array Int Int))) (= |c_ULTIMATE.start_main_~a~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0 v_ArrVal_742)) |c_~#pstate~0.base| v_ArrVal_739) |c_~#pp~0.base|) |c_~#pp~0.offset|))))) is different from false [2022-12-13 14:17:16,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:17:16,377 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-12-13 14:17:16,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2022-12-13 14:17:16,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:17:16,389 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:17:16,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2022-12-13 14:17:16,393 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:17:16,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-12-13 14:17:16,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2022-12-13 14:17:16,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:17:16,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 41 [2022-12-13 14:17:16,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:17:16,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-12-13 14:17:16,434 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-13 14:17:16,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 28 [2022-12-13 14:17:16,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-12-13 14:17:16,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618585282] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:17:16,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:17:16,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 9] total 33 [2022-12-13 14:17:16,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337521795] [2022-12-13 14:17:16,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:17:16,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:16,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 14:17:16,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=895, Unknown=1, NotChecked=62, Total=1122 [2022-12-13 14:17:16,541 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. cyclomatic complexity: 11 Second operand has 34 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 33 states have internal predecessors, (61), 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-12-13 14:17:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:17,302 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-12-13 14:17:17,302 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 46 transitions. [2022-12-13 14:17:17,302 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-12-13 14:17:17,303 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 46 transitions. [2022-12-13 14:17:17,303 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2022-12-13 14:17:17,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2022-12-13 14:17:17,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 46 transitions. [2022-12-13 14:17:17,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 14:17:17,303 INFO L218 hiAutomatonCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-12-13 14:17:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 46 transitions. [2022-12-13 14:17:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-12-13 14:17:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 35 states have internal predecessors, (43), 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-12-13 14:17:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-12-13 14:17:17,304 INFO L240 hiAutomatonCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-12-13 14:17:17,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 14:17:17,305 INFO L428 stractBuchiCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-12-13 14:17:17,306 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 14:17:17,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 43 transitions. [2022-12-13 14:17:17,306 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2022-12-13 14:17:17,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:17,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:17,306 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:17,307 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 14:17:17,307 INFO L748 eck$LassoCheckResult]: Stem: 1593#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1572#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1573#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1564#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1565#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1595#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1596#L19-3 assume !(init_~i~0#1 < 2); 1590#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1583#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1584#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1568#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1569#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1592#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1585#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1586#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1576#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1577#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1582#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1574#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1575#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1566#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1567#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1581#L41 [2022-12-13 14:17:17,307 INFO L750 eck$LassoCheckResult]: Loop: 1581#L41 assume 1 == g_#t~mem9#1; 1579#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1580#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1589#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1597#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1581#L41 [2022-12-13 14:17:17,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:17,307 INFO L85 PathProgramCache]: Analyzing trace with hash -939123286, now seen corresponding path program 1 times [2022-12-13 14:17:17,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:17,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330207935] [2022-12-13 14:17:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:17,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:17,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:17,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 1 times [2022-12-13 14:17:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:17,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147648211] [2022-12-13 14:17:17,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:17,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:17,372 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:17,375 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:17,376 INFO L85 PathProgramCache]: Analyzing trace with hash -289347350, now seen corresponding path program 1 times [2022-12-13 14:17:17,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:17,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897515688] [2022-12-13 14:17:17,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:17,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897515688] [2022-12-13 14:17:17,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897515688] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:17:17,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435644183] [2022-12-13 14:17:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:17,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:17:17,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:17,784 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:17:17,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 14:17:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:17,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 14:17:17,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:18,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-12-13 14:17:18,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:18,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:17:18,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:18,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:17:18,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:17:18,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:18,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:17:18,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:17:18,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-13 14:17:18,377 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:17:18,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2022-12-13 14:17:18,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-12-13 14:17:18,457 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 14:17:18,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435644183] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:17:18,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:17:18,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-12-13 14:17:18,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879828995] [2022-12-13 14:17:18,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:17:18,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:18,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 14:17:18,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=815, Unknown=9, NotChecked=0, Total=930 [2022-12-13 14:17:18,603 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. cyclomatic complexity: 11 Second operand has 31 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 30 states have internal predecessors, (67), 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-12-13 14:17:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:19,672 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-12-13 14:17:19,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 74 states and 86 transitions. [2022-12-13 14:17:19,673 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 26 [2022-12-13 14:17:19,674 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 74 states to 74 states and 86 transitions. [2022-12-13 14:17:19,674 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2022-12-13 14:17:19,674 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2022-12-13 14:17:19,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 86 transitions. [2022-12-13 14:17:19,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 14:17:19,674 INFO L218 hiAutomatonCegarLoop]: Abstraction has 74 states and 86 transitions. [2022-12-13 14:17:19,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states and 86 transitions. [2022-12-13 14:17:19,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 52. [2022-12-13 14:17:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 51 states have internal predecessors, (60), 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-12-13 14:17:19,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-12-13 14:17:19,676 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-12-13 14:17:19,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 14:17:19,677 INFO L428 stractBuchiCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-12-13 14:17:19,677 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 14:17:19,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 60 transitions. [2022-12-13 14:17:19,677 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2022-12-13 14:17:19,677 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:19,677 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:19,678 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:19,678 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 14:17:19,678 INFO L748 eck$LassoCheckResult]: Stem: 1935#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 1910#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 1911#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1904#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1905#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 1939#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 1940#L19-3 assume !(init_~i~0#1 < 2); 1930#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1923#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 1924#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 1906#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1907#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1934#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 1925#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 1926#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1936#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1942#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1937#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 1916#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 1917#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 1922#L27-7 assume !(f_~i~1#1 < 2); 1941#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 1954#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1943#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1931#L41 [2022-12-13 14:17:19,678 INFO L750 eck$LassoCheckResult]: Loop: 1931#L41 assume 1 == g_#t~mem9#1; 1932#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1947#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 1944#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 1945#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 1931#L41 [2022-12-13 14:17:19,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:19,678 INFO L85 PathProgramCache]: Analyzing trace with hash -501415375, now seen corresponding path program 1 times [2022-12-13 14:17:19,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:19,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014542632] [2022-12-13 14:17:19,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:19,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:20,157 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:17:20,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:20,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014542632] [2022-12-13 14:17:20,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014542632] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:17:20,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102026893] [2022-12-13 14:17:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:20,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:17:20,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:20,159 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:17:20,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 14:17:20,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:20,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 14:17:20,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:20,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-12-13 14:17:20,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:20,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:17:20,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-12-13 14:17:20,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:20,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:17:20,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:20,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 14:17:20,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:20,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 14:17:20,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:20,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:17:20,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 14:17:20,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 14:17:20,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:17:20,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 14:17:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:17:20,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 14:17:20,634 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_~#pp~0.offset| (* 4 |c_ULTIMATE.start_f_~i~1#1|))) (.cse1 (+ |c_~#pp~0.offset| 4))) (and (forall ((v_ArrVal_1062 Int) (v_ArrVal_1065 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.base| |c_~#pp~0.base|) .cse0 v_ArrVal_1062)) |c_~#pstate~0.base| v_ArrVal_1065) |c_~#pp~0.base|) .cse1) 0)) (forall ((v_ArrVal_1064 Int) (v_ArrVal_1063 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_~#pp~0.base| (store (select |c_#memory_$Pointer$.offset| |c_~#pp~0.base|) .cse0 v_ArrVal_1064)) |c_~#pstate~0.base| v_ArrVal_1063) |c_~#pp~0.base|) .cse1) 0)))) is different from false [2022-12-13 14:17:20,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 14:17:20,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-13 14:17:20,709 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 14:17:20,713 INFO L321 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2022-12-13 14:17:20,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2022-12-13 14:17:20,719 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 14:17:20,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 1 [2022-12-13 14:17:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:17:20,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1102026893] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 14:17:20,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 14:17:20,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 27 [2022-12-13 14:17:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977242716] [2022-12-13 14:17:20,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 14:17:20,748 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 14:17:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 102360307, now seen corresponding path program 2 times [2022-12-13 14:17:20,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:20,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128089135] [2022-12-13 14:17:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:20,753 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:20,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:20,757 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:20,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:20,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 14:17:20,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=595, Unknown=1, NotChecked=50, Total=756 [2022-12-13 14:17:20,912 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. cyclomatic complexity: 13 Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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-12-13 14:17:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:21,619 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-12-13 14:17:21,619 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 39 transitions. [2022-12-13 14:17:21,619 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-12-13 14:17:21,620 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 35 states and 38 transitions. [2022-12-13 14:17:21,620 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2022-12-13 14:17:21,620 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 31 [2022-12-13 14:17:21,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 38 transitions. [2022-12-13 14:17:21,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:17:21,621 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 14:17:21,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 38 transitions. [2022-12-13 14:17:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-12-13 14:17:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 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-12-13 14:17:21,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-12-13 14:17:21,623 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 14:17:21,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 14:17:21,624 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-12-13 14:17:21,624 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 14:17:21,624 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 38 transitions. [2022-12-13 14:17:21,624 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2022-12-13 14:17:21,624 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 14:17:21,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 14:17:21,625 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:17:21,625 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-12-13 14:17:21,625 INFO L748 eck$LassoCheckResult]: Stem: 2215#$Ultimate##0 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(14, 2);call #Ultimate.allocInit(12, 3);~#pp~0.base, ~#pp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset, 4);call write~init~$Pointer$(0, 0, ~#pp~0.base, 4 + ~#pp~0.offset, 4);~#pstate~0.base, ~#pstate~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~int(0, ~#pstate~0.base, ~#pstate~0.offset, 4);call write~init~int(0, ~#pstate~0.base, 4 + ~#pstate~0.offset, 4);~counter~0 := 1; 2193#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~ret12#1.base, main_#t~ret12#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~b~0#1.base, main_~b~0#1.offset;assume { :begin_inline_init } true;havoc init_#t~post4#1, init_~i~0#1;havoc init_~i~0#1;init_~i~0#1 := 0; 2194#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2185#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2186#L19-3 assume !!(init_~i~0#1 < 2);call write~$Pointer$(0, 0, ~#pp~0.base, ~#pp~0.offset + 4 * init_~i~0#1, 4);call write~int(0, ~#pstate~0.base, ~#pstate~0.offset + 4 * init_~i~0#1, 4); 2216#L19-2 init_#t~post4#1 := init_~i~0#1;init_~i~0#1 := 1 + init_#t~post4#1;havoc init_#t~post4#1; 2217#L19-3 assume !(init_~i~0#1 < 2); 2211#L17 assume { :end_inline_init } true;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 2203#fake_malloc_returnLabel#1 main_#t~ret11#1.base, main_#t~ret11#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~a~0#1.base, main_~a~0#1.offset := main_#t~ret11#1.base, main_#t~ret11#1.offset;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_fake_malloc } true;fake_malloc_#in~size#1 := 4;havoc fake_malloc_#res#1.base, fake_malloc_#res#1.offset;havoc fake_malloc_#t~post10#1, fake_malloc_~size#1;fake_malloc_~size#1 := fake_malloc_#in~size#1;fake_malloc_#t~post10#1 := ~counter~0;~counter~0 := 1 + fake_malloc_#t~post10#1;fake_malloc_#res#1.base, fake_malloc_#res#1.offset := 0, fake_malloc_#t~post10#1;havoc fake_malloc_#t~post10#1; 2204#fake_malloc_returnLabel#2 main_#t~ret12#1.base, main_#t~ret12#1.offset := fake_malloc_#res#1.base, fake_malloc_#res#1.offset;assume { :end_inline_fake_malloc } true;main_~b~0#1.base, main_~b~0#1.offset := main_#t~ret12#1.base, main_#t~ret12#1.offset;havoc main_#t~ret12#1.base, main_#t~ret12#1.offset; 2189#L59 assume !((main_~a~0#1.base == 0 && main_~a~0#1.offset == 0) || (main_~b~0#1.base == 0 && main_~b~0#1.offset == 0));assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2190#L27-3 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2214#L28 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2205#L25 assume { :end_inline_f } true;assume { :begin_inline_f } true;f_#in~pointer#1.base, f_#in~pointer#1.offset := main_~b~0#1.base, main_~b~0#1.offset;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset, f_#t~post5#1, f_~pointer#1.base, f_~pointer#1.offset, f_~i~1#1;f_~pointer#1.base, f_~pointer#1.offset := f_#in~pointer#1.base, f_#in~pointer#1.offset;havoc f_~i~1#1;f_~i~1#1 := 0; 2206#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2195#L28-1 assume !(f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0);havoc f_#t~mem6#1.base, f_#t~mem6#1.offset; 2196#L27-6 f_#t~post5#1 := f_~i~1#1;f_~i~1#1 := 1 + f_#t~post5#1;havoc f_#t~post5#1; 2202#L27-7 assume !!(f_~i~1#1 < 2);call f_#t~mem6#1.base, f_#t~mem6#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4); 2218#L28-1 assume f_#t~mem6#1.base == 0 && f_#t~mem6#1.offset == 0;havoc f_#t~mem6#1.base, f_#t~mem6#1.offset;call write~$Pointer$(f_~pointer#1.base, f_~pointer#1.offset, ~#pp~0.base, ~#pp~0.offset + 4 * f_~i~1#1, 4);call write~int(1, ~#pstate~0.base, ~#pstate~0.offset + 4 * f_~i~1#1, 4); 2207#L25-1 assume { :end_inline_f } true;assume { :begin_inline_g } true;g_#in~pointer#1.base, g_#in~pointer#1.offset := main_~a~0#1.base, main_~a~0#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset, g_#t~mem9#1, g_#t~post7#1, g_~pointer#1.base, g_~pointer#1.offset, g_~i~2#1;g_~pointer#1.base, g_~pointer#1.offset := g_#in~pointer#1.base, g_#in~pointer#1.offset;havoc g_~i~2#1;g_~i~2#1 := 0; 2187#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2188#L39 assume g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset;havoc g_#t~mem8#1.base, g_#t~mem8#1.offset;call g_#t~mem9#1 := read~int(~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2212#L41 assume 1 == g_#t~mem9#1; 2198#L41-2 havoc g_#t~mem9#1;call write~int(2, ~#pstate~0.base, ~#pstate~0.offset + 4 * g_~i~2#1, 4); 2199#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2210#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2200#L39 [2022-12-13 14:17:21,625 INFO L750 eck$LassoCheckResult]: Loop: 2200#L39 assume !(g_#t~mem8#1.base == g_~pointer#1.base && g_#t~mem8#1.offset == g_~pointer#1.offset);havoc g_#t~mem8#1.base, g_#t~mem8#1.offset; 2201#L38-2 g_#t~post7#1 := g_~i~2#1;g_~i~2#1 := 1 + g_#t~post7#1;havoc g_#t~post7#1; 2219#L38-3 assume !!(g_~i~2#1 < 2);call g_#t~mem8#1.base, g_#t~mem8#1.offset := read~$Pointer$(~#pp~0.base, ~#pp~0.offset + 4 * g_~i~2#1, 4); 2200#L39 [2022-12-13 14:17:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:21,626 INFO L85 PathProgramCache]: Analyzing trace with hash -147881120, now seen corresponding path program 2 times [2022-12-13 14:17:21,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:21,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907969505] [2022-12-13 14:17:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:21,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:21,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:21,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:21,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:21,664 INFO L85 PathProgramCache]: Analyzing trace with hash 116228, now seen corresponding path program 5 times [2022-12-13 14:17:21,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:21,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165197213] [2022-12-13 14:17:21,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:21,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:21,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:21,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:17:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:17:21,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:17:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:17:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1110086213, now seen corresponding path program 1 times [2022-12-13 14:17:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:17:21,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474517231] [2022-12-13 14:17:21,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:17:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:21,735 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 14:17:21,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:17:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474517231] [2022-12-13 14:17:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474517231] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 14:17:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997366547] [2022-12-13 14:17:21,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:17:21,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 14:17:21,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:17:21,737 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 14:17:21,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 14:17:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:17:21,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 14:17:21,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:17:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 14:17:21,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:17:21,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997366547] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:17:21,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 14:17:21,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-12-13 14:17:21,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873030379] [2022-12-13 14:17:21,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:17:21,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:17:21,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:17:21,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:17:21,908 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. cyclomatic complexity: 6 Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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-12-13 14:17:21,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 14:17:21,934 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-12-13 14:17:21,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 43 transitions. [2022-12-13 14:17:21,934 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 14:17:21,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 0 states and 0 transitions. [2022-12-13 14:17:21,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-12-13 14:17:21,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-12-13 14:17:21,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-12-13 14:17:21,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:17:21,935 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:17:21,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:17:21,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:17:21,935 INFO L428 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 14:17:21,935 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 14:17:21,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-12-13 14:17:21,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-12-13 14:17:21,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-12-13 14:17:21,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 02:17:21 BoogieIcfgContainer [2022-12-13 14:17:21,940 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 14:17:21,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:17:21,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:17:21,941 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:17:21,941 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:16:45" (3/4) ... [2022-12-13 14:17:21,943 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 14:17:21,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:17:21,944 INFO L158 Benchmark]: Toolchain (without parser) took 37508.74ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 100.5MB in the beginning and 119.8MB in the end (delta: -19.3MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-12-13 14:17:21,944 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:17:21,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.19ms. Allocated memory is still 127.9MB. Free memory was 100.3MB in the beginning and 89.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 14:17:21,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.39ms. Allocated memory is still 127.9MB. Free memory was 89.4MB in the beginning and 87.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:17:21,944 INFO L158 Benchmark]: Boogie Preprocessor took 20.97ms. Allocated memory is still 127.9MB. Free memory was 87.7MB in the beginning and 86.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:17:21,944 INFO L158 Benchmark]: RCFGBuilder took 356.93ms. Allocated memory is still 127.9MB. Free memory was 86.0MB in the beginning and 69.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 14:17:21,944 INFO L158 Benchmark]: BuchiAutomizer took 36896.31ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 69.0MB in the beginning and 120.8MB in the end (delta: -51.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-12-13 14:17:21,945 INFO L158 Benchmark]: Witness Printer took 2.51ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 119.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:17:21,945 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.12ms. Allocated memory is still 127.9MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 190.19ms. Allocated memory is still 127.9MB. Free memory was 100.3MB in the beginning and 89.8MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.39ms. Allocated memory is still 127.9MB. Free memory was 89.4MB in the beginning and 87.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.97ms. Allocated memory is still 127.9MB. Free memory was 87.7MB in the beginning and 86.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 356.93ms. Allocated memory is still 127.9MB. Free memory was 86.0MB in the beginning and 69.5MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 36896.31ms. Allocated memory was 127.9MB in the beginning and 186.6MB in the end (delta: 58.7MB). Free memory was 69.0MB in the beginning and 120.8MB in the end (delta: -51.8MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 2.51ms. Allocated memory is still 186.6MB. Free memory was 120.8MB in the beginning and 119.8MB 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 12 terminating modules (10 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 3 + -2 * i and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 3 and consists of 4 locations. 10 modules have a trivial ranking function, the largest among these consists of 34 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 36.8s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 33.4s. Construction of modules took 1.1s. Büchi inclusion checks took 2.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1004 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1002 mSDsluCounter, 1281 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 96 IncrementalHoareTripleChecker+Unchecked, 983 mSDsCounter, 97 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1511 IncrementalHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 97 mSolverCounterUnsat, 298 mSDtfsCounter, 1511 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU6 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital1502 mio100 ax100 hnf100 lsp97 ukn31 mio100 lsp36 div100 bol100 ite100 ukn100 eq183 hnf91 smp100 dnf113 smp100 tf100 neg98 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-12-13 14:17:21,955 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:22,164 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 14:17:22,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:22,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 14:17:22,761 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:22,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 14:17:23,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 14:17:23,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fe8879b-1e53-4f89-8c51-245c67911f79/bin/uautomizer-uyxdKDjOR8/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