./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/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_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/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 64bit --witnessprinter.graph.data.programhash a7eac656f4f87b6afedc7c9123b2a00f0a77432e0932a24df49c305c8202e110 --- 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 15:03:58,683 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:03:58,685 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:03:58,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:03:58,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:03:58,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:03:58,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:03:58,699 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:03:58,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:03:58,700 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:03:58,701 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:03:58,702 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:03:58,702 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:03:58,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:03:58,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:03:58,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:03:58,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:03:58,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:03:58,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:03:58,707 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:03:58,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:03:58,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:03:58,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:03:58,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:03:58,711 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:03:58,712 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:03:58,712 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:03:58,712 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:03:58,713 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:03:58,713 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:03:58,713 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:03:58,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:03:58,714 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:03:58,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:03:58,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:03:58,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:03:58,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:03:58,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:03:58,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:03:58,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:03:58,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:03:58,718 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-12-13 15:03:58,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:03:58,731 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:03:58,731 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:03:58,732 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:03:58,732 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:03:58,732 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:03:58,732 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:03:58,733 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 15:03:58,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:03:58,733 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 15:03:58,734 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:03:58,734 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:03:58,734 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:03:58,735 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 15:03:58,735 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_48dbd32a-3f04-4806-9141-48d8d284bd45/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_48dbd32a-3f04-4806-9141-48d8d284bd45/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a7eac656f4f87b6afedc7c9123b2a00f0a77432e0932a24df49c305c8202e110 [2022-12-13 15:03:58,899 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:03:58,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:03:58,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:03:58,919 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:03:58,919 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:03:58,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2022-12-13 15:04:01,487 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:04:01,672 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:04:01,673 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/sv-benchmarks/c/termination-memory-alloca/c.02-alloca.i [2022-12-13 15:04:01,681 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/data/2d33a2280/9afa1c7e04c24811b84cafc6724cd32b/FLAG4d0538d50 [2022-12-13 15:04:01,693 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/data/2d33a2280/9afa1c7e04c24811b84cafc6724cd32b [2022-12-13 15:04:01,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:04:01,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:04:01,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:04:01,698 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:04:01,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:04:01,701 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:01,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cb181d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01, skipping insertion in model container [2022-12-13 15:04:01,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:01,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:04:01,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:04:01,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:04:01,949 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:04:01,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:04:01,998 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:04:01,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01 WrapperNode [2022-12-13 15:04:01,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:04:01,999 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:04:02,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:04:02,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:04:02,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,030 INFO L138 Inliner]: procedures = 111, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2022-12-13 15:04:02,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:04:02,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:04:02,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:04:02,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:04:02,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,043 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,048 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,048 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:04:02,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:04:02,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:04:02,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:04:02,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (1/1) ... [2022-12-13 15:04:02,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:02,077 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:02,079 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 15:04:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 15:04:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:04:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:04:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:04:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:04:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:04:02,189 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:04:02,191 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:04:02,297 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:04:02,302 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:04:02,302 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-13 15:04:02,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:04:02 BoogieIcfgContainer [2022-12-13 15:04:02,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:04:02,305 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 15:04:02,305 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 15:04:02,308 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 15:04:02,309 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:04:02,309 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 03:04:01" (1/3) ... [2022-12-13 15:04:02,310 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25899bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 03:04:02, skipping insertion in model container [2022-12-13 15:04:02,310 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:04:02,310 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:04:01" (2/3) ... [2022-12-13 15:04:02,311 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@25899bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 03:04:02, skipping insertion in model container [2022-12-13 15:04:02,311 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 15:04:02,311 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:04:02" (3/3) ... [2022-12-13 15:04:02,313 INFO L332 chiAutomizerObserver]: Analyzing ICFG c.02-alloca.i [2022-12-13 15:04:02,362 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 15:04:02,362 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 15:04:02,362 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 15:04:02,362 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 15:04:02,362 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 15:04:02,362 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 15:04:02,362 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 15:04:02,363 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 15:04:02,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 15:04:02,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:02,383 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:02,383 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:02,388 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 15:04:02,388 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 15:04:02,388 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 15:04:02,389 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 15:04:02,390 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:02,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:02,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:02,390 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 15:04:02,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-12-13 15:04:02,396 INFO L748 eck$LassoCheckResult]: Stem: 11#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 7#L555-5true [2022-12-13 15:04:02,397 INFO L750 eck$LassoCheckResult]: Loop: 7#L555-5true call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 12#L555-1true assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3#L555-3true assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4#L558-3true assume !true; 13#L558-4true call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 7#L555-5true [2022-12-13 15:04:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 15:04:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:02,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371445908] [2022-12-13 15:04:02,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,506 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 35409968, now seen corresponding path program 1 times [2022-12-13 15:04:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:02,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179817291] [2022-12-13 15:04:02,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:02,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:02,584 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 15:04:02,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:02,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179817291] [2022-12-13 15:04:02,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179817291] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:02,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:02,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:04:02,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020498937] [2022-12-13 15:04:02,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:02,589 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 15:04:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:02,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:04:02,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:04:02,614 INFO L87 Difference]: Start difference. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 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 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 15:04:02,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:04:02,619 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-12-13 15:04:02,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2022-12-13 15:04:02,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:02,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 8 states and 10 transitions. [2022-12-13 15:04:02,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2022-12-13 15:04:02,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2022-12-13 15:04:02,624 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 10 transitions. [2022-12-13 15:04:02,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:04:02,624 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-12-13 15:04:02,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 10 transitions. [2022-12-13 15:04:02,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-12-13 15:04:02,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 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 15:04:02,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2022-12-13 15:04:02,642 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-12-13 15:04:02,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:04:02,645 INFO L428 stractBuchiCegarLoop]: Abstraction has 8 states and 10 transitions. [2022-12-13 15:04:02,645 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 15:04:02,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 10 transitions. [2022-12-13 15:04:02,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:02,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:02,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:02,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 15:04:02,646 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 15:04:02,647 INFO L748 eck$LassoCheckResult]: Stem: 37#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 38#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 40#L555-5 [2022-12-13 15:04:02,647 INFO L750 eck$LassoCheckResult]: Loop: 40#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 41#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 34#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 35#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 36#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 39#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 40#L555-5 [2022-12-13 15:04:02,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:02,648 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 15:04:02,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:02,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992470271] [2022-12-13 15:04:02,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:02,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,706 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:02,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:02,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1097702127, now seen corresponding path program 1 times [2022-12-13 15:04:02,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:02,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882126791] [2022-12-13 15:04:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:02,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:02,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:02,749 INFO L85 PathProgramCache]: Analyzing trace with hash 177751345, now seen corresponding path program 1 times [2022-12-13 15:04:02,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:02,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050607414] [2022-12-13 15:04:02,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:02,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,800 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:02,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:03,442 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 15:04:03,443 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 15:04:03,443 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 15:04:03,443 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 15:04:03,443 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 15:04:03,443 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:03,443 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 15:04:03,443 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 15:04:03,443 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration2_Lasso [2022-12-13 15:04:03,444 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 15:04:03,444 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 15:04:03,461 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 15:04:03,468 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 15:04:03,469 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:04:03,471 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:04:03,473 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 15:04:03,475 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 15:04:03,476 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 15:04:03,477 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 15:04:03,479 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 15:04:03,481 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 15:04:03,483 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 15:04:03,485 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 15:04:03,487 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 15:04:03,489 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 15:04:03,490 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 15:04:03,492 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-12-13 15:04:03,894 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 15:04:03,895 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 15:04:03,897 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 15:04:03,898 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 15:04:04,179 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 15:04:04,183 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 15:04:04,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,187 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-12-13 15:04:04,188 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 15:04:04,198 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,198 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,199 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,199 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,199 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,200 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,201 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,202 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:04,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,207 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-12-13 15:04:04,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 15:04:04,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,219 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,220 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,220 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,222 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-12-13 15:04:04,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,226 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-12-13 15:04:04,229 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 15:04:04,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,239 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,241 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-12-13 15:04:04,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-12-13 15:04:04,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 15:04:04,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,257 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,257 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,260 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,260 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,263 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-12-13 15:04:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-12-13 15:04:04,270 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 15:04:04,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,280 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,280 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,280 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,280 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,282 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:04,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-12-13 15:04:04,289 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 15:04:04,298 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,301 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,303 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-12-13 15:04:04,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,304 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,306 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-12-13 15:04:04,307 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 15:04:04,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,319 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-12-13 15:04:04,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,323 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,324 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-12-13 15:04:04,326 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 15:04:04,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,336 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,338 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,339 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,342 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,345 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2022-12-13 15:04:04,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,346 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-12-13 15:04:04,348 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 15:04:04,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,363 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,365 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-12-13 15:04:04,369 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 15:04:04,378 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,378 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,379 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,379 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-12-13 15:04:04,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,385 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-12-13 15:04:04,387 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 15:04:04,397 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,397 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,397 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,397 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,399 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,399 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,403 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-12-13 15:04:04,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,406 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,407 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-12-13 15:04:04,409 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 15:04:04,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,420 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,420 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,423 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,425 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-12-13 15:04:04,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,426 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-12-13 15:04:04,428 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 15:04:04,438 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,439 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,439 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,440 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-12-13 15:04:04,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,444 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-12-13 15:04:04,446 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 15:04:04,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,455 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:04,456 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,456 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,456 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,456 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:04,456 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:04,457 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,460 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-12-13 15:04:04,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,461 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-12-13 15:04:04,463 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 15:04:04,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,477 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-12-13 15:04:04,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,481 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-12-13 15:04:04,483 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 15:04:04,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,495 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,495 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,499 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-12-13 15:04:04,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,503 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-12-13 15:04:04,505 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 15:04:04,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,515 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,521 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,523 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-12-13 15:04:04,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,525 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-12-13 15:04:04,527 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 15:04:04,538 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,538 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,538 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,544 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,544 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,555 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,558 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-12-13 15:04:04,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,559 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-12-13 15:04:04,562 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 15:04:04,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,574 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,574 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,577 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-12-13 15:04:04,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,580 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,581 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-12-13 15:04:04,583 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 15:04:04,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,597 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,597 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,605 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-12-13 15:04:04,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,608 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-12-13 15:04:04,611 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 15:04:04,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,623 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,628 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-12-13 15:04:04,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,631 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-12-13 15:04:04,633 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 15:04:04,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,646 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,646 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:04,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:04,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,654 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-12-13 15:04:04,656 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 15:04:04,666 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:04,666 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:04,666 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:04,666 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:04,669 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:04,669 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:04,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 15:04:04,688 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-12-13 15:04:04,688 INFO L444 ModelExtractionUtils]: 5 out of 16 variables were initially zero. Simplification set additionally 8 variables to zero. [2022-12-13 15:04:04,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:04,690 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:04,717 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:04,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-12-13 15:04:04,718 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 15:04:04,730 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 15:04:04,730 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 15:04:04,730 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_1 + 1 Supporting invariants [] [2022-12-13 15:04:04,733 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-12-13 15:04:04,801 INFO L156 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2022-12-13 15:04:04,823 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2022-12-13 15:04:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:04,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:04:04,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:04,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 15:04:04,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:04,972 INFO L321 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-12-13 15:04:04,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 96 [2022-12-13 15:04:04,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:04:05,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 15:04:05,020 INFO L321 Elim1Store]: treesize reduction 15, result has 37.5 percent of original size [2022-12-13 15:04:05,021 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 51 [2022-12-13 15:04:05,038 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:04:05,038 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 19 treesize of output 23 [2022-12-13 15:04:05,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2022-12-13 15:04:05,153 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 15 treesize of output 11 [2022-12-13 15:04:05,273 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 15:04:05,275 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-12-13 15:04:05,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3 Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:05,403 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 10 transitions. cyclomatic complexity: 3. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 22 states and 28 transitions. Complement of second has 13 states. [2022-12-13 15:04:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2022-12-13 15:04:05,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:05,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2022-12-13 15:04:05,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2022-12-13 15:04:05,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:05,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 8 letters. Loop has 6 letters. [2022-12-13 15:04:05,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:05,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. Stem has 2 letters. Loop has 12 letters. [2022-12-13 15:04:05,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:05,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 28 transitions. [2022-12-13 15:04:05,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:05,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 21 states and 27 transitions. [2022-12-13 15:04:05,408 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 15:04:05,408 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2022-12-13 15:04:05,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2022-12-13 15:04:05,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:04:05,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-12-13 15:04:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2022-12-13 15:04:05,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-12-13 15:04:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2022-12-13 15:04:05,411 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-12-13 15:04:05,411 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2022-12-13 15:04:05,411 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 15:04:05,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2022-12-13 15:04:05,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:05,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:05,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:05,412 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:05,412 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 15:04:05,412 INFO L748 eck$LassoCheckResult]: Stem: 213#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 214#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 216#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 218#L555-1 assume !test_fun_#t~short7#1; 220#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 210#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 211#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 207#L558-3 [2022-12-13 15:04:05,412 INFO L750 eck$LassoCheckResult]: Loop: 207#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 223#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 207#L558-3 [2022-12-13 15:04:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1806908815, now seen corresponding path program 1 times [2022-12-13 15:04:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:05,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57623773] [2022-12-13 15:04:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:05,461 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 15:04:05,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:05,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57623773] [2022-12-13 15:04:05,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57623773] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:04:05,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:04:05,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:04:05,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681329862] [2022-12-13 15:04:05,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:04:05,463 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 15:04:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 1 times [2022-12-13 15:04:05,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:05,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435029290] [2022-12-13 15:04:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,475 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:05,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:05,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:04:05,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:04:05,520 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 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 15:04:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:04:05,529 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-12-13 15:04:05,529 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 25 transitions. [2022-12-13 15:04:05,530 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:05,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 19 states and 22 transitions. [2022-12-13 15:04:05,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2022-12-13 15:04:05,531 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2022-12-13 15:04:05,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2022-12-13 15:04:05,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:04:05,531 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-12-13 15:04:05,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2022-12-13 15:04:05,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-12-13 15:04:05,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:05,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-12-13 15:04:05,533 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-12-13 15:04:05,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:04:05,534 INFO L428 stractBuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-12-13 15:04:05,534 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 15:04:05,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2022-12-13 15:04:05,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:05,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:05,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:05,535 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:05,536 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 15:04:05,536 INFO L748 eck$LassoCheckResult]: Stem: 259#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 260#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 263#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 265#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 253#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 254#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 257#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 261#L558-3 [2022-12-13 15:04:05,536 INFO L750 eck$LassoCheckResult]: Loop: 261#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 269#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 261#L558-3 [2022-12-13 15:04:05,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849233, now seen corresponding path program 1 times [2022-12-13 15:04:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:05,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530669526] [2022-12-13 15:04:05,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:05,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,559 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:05,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 2 times [2022-12-13 15:04:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:05,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157377433] [2022-12-13 15:04:05,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,583 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:05,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:05,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326070, now seen corresponding path program 2 times [2022-12-13 15:04:05,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:05,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264559865] [2022-12-13 15:04:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:05,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,617 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:05,634 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:06,659 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 15:04:06,659 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 15:04:06,659 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 15:04:06,659 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 15:04:06,659 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 15:04:06,659 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:06,659 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 15:04:06,659 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 15:04:06,659 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration4_Lasso [2022-12-13 15:04:06,659 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 15:04:06,659 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 15:04:06,664 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 15:04:06,666 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 15:04:06,667 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 15:04:06,668 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 15:04:06,670 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 15:04:06,672 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 15:04:06,673 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 15:04:06,674 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 15:04:06,676 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 15:04:06,677 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 15:04:06,679 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 15:04:06,680 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 15:04:06,682 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 15:04:07,090 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 15:04:07,092 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 15:04:07,093 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 15:04:07,095 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 15:04:07,096 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 15:04:07,098 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 15:04:07,319 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 15:04:07,319 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 15:04:07,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,320 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-12-13 15:04:07,322 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 15:04:07,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,332 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,332 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,334 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,336 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-12-13 15:04:07,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,337 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,338 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-12-13 15:04:07,339 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 15:04:07,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,349 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,349 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,350 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,351 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,353 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2022-12-13 15:04:07,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,354 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-12-13 15:04:07,361 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 15:04:07,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,373 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2022-12-13 15:04:07,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,376 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,377 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-12-13 15:04:07,379 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 15:04:07,388 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,389 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,389 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,393 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,395 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2022-12-13 15:04:07,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,396 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-12-13 15:04:07,398 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 15:04:07,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,409 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,409 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-12-13 15:04:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,416 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-12-13 15:04:07,418 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 15:04:07,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,429 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-12-13 15:04:07,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,432 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,433 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-12-13 15:04:07,434 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 15:04:07,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,445 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,445 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,445 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,447 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,449 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-12-13 15:04:07,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,450 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-12-13 15:04:07,452 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 15:04:07,462 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,462 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,463 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,463 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,463 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,463 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,464 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-12-13 15:04:07,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,467 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2022-12-13 15:04:07,470 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 15:04:07,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,481 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,481 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,483 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,485 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2022-12-13 15:04:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,486 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2022-12-13 15:04:07,488 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 15:04:07,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,499 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,499 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,499 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,499 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,500 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,503 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Ended with exit code 0 [2022-12-13 15:04:07,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,504 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,504 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2022-12-13 15:04:07,506 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-12-13 15:04:07,515 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,515 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,516 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,516 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,516 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,516 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,516 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2022-12-13 15:04:07,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,520 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2022-12-13 15:04:07,522 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 15:04:07,532 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:07,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,533 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,533 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,533 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:07,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:07,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2022-12-13 15:04:07,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,538 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2022-12-13 15:04:07,540 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 15:04:07,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,555 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,555 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,564 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2022-12-13 15:04:07,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,568 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,569 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2022-12-13 15:04:07,570 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 15:04:07,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,581 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2022-12-13 15:04:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,589 INFO L229 MonitoredProcess]: Starting monitored process 40 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2022-12-13 15:04:07,591 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 15:04:07,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,602 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,602 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,606 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:07,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Ended with exit code 0 [2022-12-13 15:04:07,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,609 INFO L229 MonitoredProcess]: Starting monitored process 41 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2022-12-13 15:04:07,611 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 15:04:07,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:07,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:07,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:07,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:07,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:07,624 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:07,632 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 15:04:07,643 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-12-13 15:04:07,643 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2022-12-13 15:04:07,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:07,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:07,644 INFO L229 MonitoredProcess]: Starting monitored process 42 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:07,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2022-12-13 15:04:07,646 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 15:04:07,657 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 15:04:07,657 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 15:04:07,657 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0#1.base) ULTIMATE.start_test_fun_~y_ref~0#1.offset)_2 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_2 Supporting invariants [] [2022-12-13 15:04:07,659 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Ended with exit code 0 [2022-12-13 15:04:07,724 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-12-13 15:04:07,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:07,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:04:07,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:07,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 15:04:07,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:07,787 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 15:04:07,787 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 15:04:07,788 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:07,813 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 31 states and 36 transitions. Complement of second has 7 states. [2022-12-13 15:04:07,813 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 15:04:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:04:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-12-13 15:04:07,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 2 letters. [2022-12-13 15:04:07,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:07,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2022-12-13 15:04:07,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:07,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2022-12-13 15:04:07,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:07,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 36 transitions. [2022-12-13 15:04:07,816 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:07,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 32 transitions. [2022-12-13 15:04:07,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-12-13 15:04:07,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-12-13 15:04:07,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 32 transitions. [2022-12-13 15:04:07,817 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:04:07,817 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-12-13 15:04:07,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 32 transitions. [2022-12-13 15:04:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-12-13 15:04:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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 15:04:07,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-12-13 15:04:07,818 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-12-13 15:04:07,818 INFO L428 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-12-13 15:04:07,818 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 15:04:07,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2022-12-13 15:04:07,818 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2022-12-13 15:04:07,818 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:07,818 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:07,819 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:07,819 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 15:04:07,819 INFO L748 eck$LassoCheckResult]: Stem: 453#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 454#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 456#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 461#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 467#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 466#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 465#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 464#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 452#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 455#L558-4 [2022-12-13 15:04:07,819 INFO L750 eck$LassoCheckResult]: Loop: 455#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 457#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 458#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 445#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 446#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 449#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 455#L558-4 [2022-12-13 15:04:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326068, now seen corresponding path program 1 times [2022-12-13 15:04:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671441413] [2022-12-13 15:04:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:07,835 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:07,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:07,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:07,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1810417107, now seen corresponding path program 2 times [2022-12-13 15:04:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:07,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838018156] [2022-12-13 15:04:07,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:07,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:07,852 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:07,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:07,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash 94145286, now seen corresponding path program 1 times [2022-12-13 15:04:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:07,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431783775] [2022-12-13 15:04:07,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:07,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:07,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:07,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:07,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:08,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Ended with exit code 0 [2022-12-13 15:04:09,252 INFO L210 LassoAnalysis]: Preferences: [2022-12-13 15:04:09,252 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-12-13 15:04:09,252 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-12-13 15:04:09,252 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-12-13 15:04:09,252 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-12-13 15:04:09,252 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:09,252 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-12-13 15:04:09,252 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-12-13 15:04:09,252 INFO L133 ssoRankerPreferences]: Filename of dumped script: c.02-alloca.i_Iteration5_Lasso [2022-12-13 15:04:09,252 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-12-13 15:04:09,252 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-12-13 15:04:09,254 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 15:04:09,257 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 15:04:09,258 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 15:04:09,260 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 15:04:09,261 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 15:04:09,262 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 15:04:09,264 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 15:04:09,265 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 15:04:09,759 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 15:04:09,760 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 15:04:09,762 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 15:04:09,763 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 15:04:09,765 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 15:04:09,766 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 15:04:09,768 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 15:04:09,769 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 15:04:09,770 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 15:04:09,771 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 15:04:09,773 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 15:04:10,121 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-12-13 15:04:10,121 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-12-13 15:04:10,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,122 INFO L229 MonitoredProcess]: Starting monitored process 43 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2022-12-13 15:04:10,124 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 15:04:10,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:10,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:10,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,140 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Ended with exit code 0 [2022-12-13 15:04:10,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,141 INFO L229 MonitoredProcess]: Starting monitored process 44 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2022-12-13 15:04:10,143 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 15:04:10,153 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,153 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:10,153 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,153 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,153 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,154 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:10,154 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:10,155 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:10,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,158 INFO L229 MonitoredProcess]: Starting monitored process 45 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Waiting until timeout for monitored process [2022-12-13 15:04:10,161 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 15:04:10,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,171 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:10,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,171 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:10,171 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:10,172 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,174 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (45)] Ended with exit code 0 [2022-12-13 15:04:10,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,175 INFO L229 MonitoredProcess]: Starting monitored process 46 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2022-12-13 15:04:10,178 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 15:04:10,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:10,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,188 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:10,188 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:10,190 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,192 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,193 INFO L229 MonitoredProcess]: Starting monitored process 47 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2022-12-13 15:04:10,195 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 15:04:10,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:10,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:10,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:10,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,209 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,210 INFO L229 MonitoredProcess]: Starting monitored process 48 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2022-12-13 15:04:10,213 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 15:04:10,222 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,223 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-12-13 15:04:10,223 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,223 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,223 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,223 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-12-13 15:04:10,223 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-12-13 15:04:10,224 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,226 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Ended with exit code 0 [2022-12-13 15:04:10,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,227 INFO L229 MonitoredProcess]: Starting monitored process 49 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,228 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2022-12-13 15:04:10,229 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 15:04:10,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:10,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:10,243 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Ended with exit code 0 [2022-12-13 15:04:10,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,246 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,246 INFO L229 MonitoredProcess]: Starting monitored process 50 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Waiting until timeout for monitored process [2022-12-13 15:04:10,249 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 15:04:10,259 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,259 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,259 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,259 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,261 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:10,261 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:10,265 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (50)] Ended with exit code 0 [2022-12-13 15:04:10,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,268 INFO L229 MonitoredProcess]: Starting monitored process 51 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Waiting until timeout for monitored process [2022-12-13 15:04:10,270 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 15:04:10,279 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,279 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,279 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,280 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,281 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:10,281 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:10,284 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-12-13 15:04:10,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (51)] Ended with exit code 0 [2022-12-13 15:04:10,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,287 INFO L229 MonitoredProcess]: Starting monitored process 52 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Waiting until timeout for monitored process [2022-12-13 15:04:10,289 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 15:04:10,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-12-13 15:04:10,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-12-13 15:04:10,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-12-13 15:04:10,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-12-13 15:04:10,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-12-13 15:04:10,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-12-13 15:04:10,309 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-12-13 15:04:10,318 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2022-12-13 15:04:10,318 INFO L444 ModelExtractionUtils]: 13 out of 19 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-12-13 15:04:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 15:04:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:10,319 INFO L229 MonitoredProcess]: Starting monitored process 53 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 15:04:10,320 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Waiting until timeout for monitored process [2022-12-13 15:04:10,321 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-12-13 15:04:10,331 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-12-13 15:04:10,332 INFO L513 LassoAnalysis]: Proved termination. [2022-12-13 15:04:10,332 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0#1.base) ULTIMATE.start_test_fun_~x_ref~0#1.offset)_3 Supporting invariants [] [2022-12-13 15:04:10,334 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (52)] Ended with exit code 0 [2022-12-13 15:04:10,405 INFO L156 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2022-12-13 15:04:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:10,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:04:10,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:10,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 15:04:10,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:10,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:04:10,511 INFO L321 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-12-13 15:04:10,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 94 [2022-12-13 15:04:10,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:04:10,538 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 13 treesize of output 9 [2022-12-13 15:04:10,551 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-12-13 15:04:10,552 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 41 [2022-12-13 15:04:10,597 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:04:10,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 68 treesize of output 39 [2022-12-13 15:04:10,603 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:04:10,604 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 39 treesize of output 41 [2022-12-13 15:04:10,728 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 15:04:10,729 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2022-12-13 15:04:10,729 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 15:04:10,760 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) Result 52 states and 60 transitions. Complement of second has 7 states. [2022-12-13 15:04:10,760 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 15:04:10,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 15:04:10,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 11 transitions. [2022-12-13 15:04:10,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 11 transitions. Stem has 9 letters. Loop has 6 letters. [2022-12-13 15:04:10,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:10,761 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2022-12-13 15:04:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:10,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2022-12-13 15:04:10,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:10,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 15:04:10,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:10,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:04:10,870 INFO L321 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2022-12-13 15:04:10,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 53 treesize of output 94 [2022-12-13 15:04:10,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:04:10,888 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (53)] Forceful destruction successful, exit code 0 [2022-12-13 15:04:10,900 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 13 treesize of output 9 [2022-12-13 15:04:10,912 INFO L321 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2022-12-13 15:04:10,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 35 treesize of output 41 [2022-12-13 15:04:10,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2022-12-13 15:04:10,949 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 15 treesize of output 11 [2022-12-13 15:04:11,030 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 15:04:11,031 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 6 loop predicates [2022-12-13 15:04:11,031 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 15:04:11,113 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 28 transitions. cyclomatic complexity: 8. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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) Result 68 states and 80 transitions. Complement of second has 15 states. [2022-12-13 15:04:11,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2022-12-13 15:04:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 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 15:04:11,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 18 transitions. [2022-12-13 15:04:11,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2022-12-13 15:04:11,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:11,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2022-12-13 15:04:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:11,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2022-12-13 15:04:11,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-12-13 15:04:11,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 80 transitions. [2022-12-13 15:04:11,116 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 15:04:11,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 63 states and 75 transitions. [2022-12-13 15:04:11,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2022-12-13 15:04:11,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2022-12-13 15:04:11,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 75 transitions. [2022-12-13 15:04:11,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:04:11,118 INFO L218 hiAutomatonCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-12-13 15:04:11,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states and 75 transitions. [2022-12-13 15:04:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 55. [2022-12-13 15:04:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 54 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 15:04:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-12-13 15:04:11,122 INFO L240 hiAutomatonCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-12-13 15:04:11,122 INFO L428 stractBuchiCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-12-13 15:04:11,122 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 15:04:11,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 67 transitions. [2022-12-13 15:04:11,123 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2022-12-13 15:04:11,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:04:11,123 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:04:11,123 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:11,123 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2022-12-13 15:04:11,124 INFO L748 eck$LassoCheckResult]: Stem: 830#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 839#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 854#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 853#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 852#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 851#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 850#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 847#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 846#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 835#L555-5 [2022-12-13 15:04:11,124 INFO L750 eck$LassoCheckResult]: Loop: 835#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 836#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 858#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 861#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 862#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 871#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 872#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 842#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 835#L555-5 [2022-12-13 15:04:11,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:11,124 INFO L85 PathProgramCache]: Analyzing trace with hash -979597524, now seen corresponding path program 2 times [2022-12-13 15:04:11,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:11,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836661517] [2022-12-13 15:04:11,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:11,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:11,143 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:11,157 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:11,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:11,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1670158998, now seen corresponding path program 1 times [2022-12-13 15:04:11,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:11,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051557877] [2022-12-13 15:04:11,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:11,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:11,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:04:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:04:11,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:04:11,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:04:11,172 INFO L85 PathProgramCache]: Analyzing trace with hash 68653461, now seen corresponding path program 3 times [2022-12-13 15:04:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:04:11,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454899672] [2022-12-13 15:04:11,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:04:11,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:04:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:04:11,654 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:11,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:04:11,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454899672] [2022-12-13 15:04:11,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454899672] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:04:11,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57047048] [2022-12-13 15:04:11,655 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:04:11,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:04:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:04:11,656 INFO L229 MonitoredProcess]: Starting monitored process 54 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:04:11,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-12-13 15:04:11,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-13 15:04:11,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:04:11,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 15:04:11,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:04:11,770 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 10 treesize of output 8 [2022-12-13 15:04:11,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:04:11,780 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 14 [2022-12-13 15:04:11,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:04:11,805 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 28 treesize of output 16 [2022-12-13 15:04:11,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 15:04:11,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:04:11,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2022-12-13 15:04:11,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-12-13 15:04:11,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 25 treesize of output 20 [2022-12-13 15:04:11,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 25 treesize of output 20 [2022-12-13 15:04:11,933 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 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 15:04:11,948 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:04:11,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:04:24,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_573 Int) (v_ArrVal_575 (Array Int Int)) (v_ArrVal_569 Int)) (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_569)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse3 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< v_ArrVal_569 .cse0) (not (<= 1 v_ArrVal_576)) (< .cse0 (+ v_ArrVal_573 1)) (not (<= v_ArrVal_569 (+ (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_573)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_576)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_576 1)))))))) is different from false [2022-12-13 15:04:24,413 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 319 treesize of output 311 [2022-12-13 15:04:24,427 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 249 treesize of output 241 [2022-12-13 15:04:24,442 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 310 treesize of output 302 [2022-12-13 15:04:24,456 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 317 treesize of output 309 [2022-12-13 15:04:24,473 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 23 treesize of output 19 [2022-12-13 15:04:24,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-12-13 15:04:24,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57047048] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:04:24,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:04:24,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-12-13 15:04:24,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219386499] [2022-12-13 15:04:24,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:04:24,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:04:24,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-12-13 15:04:24,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=407, Unknown=3, NotChecked=42, Total=552 [2022-12-13 15:04:24,915 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. cyclomatic complexity: 18 Second operand has 24 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 24 states have internal predecessors, (40), 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 15:04:37,109 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 51 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:04:49,384 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 49 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:05:01,464 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 58 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:05:13,593 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 56 DAG size of output: 19 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:05:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:05:13,609 INFO L93 Difference]: Finished difference Result 96 states and 107 transitions. [2022-12-13 15:05:13,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 96 states and 107 transitions. [2022-12-13 15:05:13,610 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-12-13 15:05:13,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 96 states to 43 states and 47 transitions. [2022-12-13 15:05:13,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2022-12-13 15:05:13,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2022-12-13 15:05:13,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 47 transitions. [2022-12-13 15:05:13,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:05:13,610 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-12-13 15:05:13,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 47 transitions. [2022-12-13 15:05:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2022-12-13 15:05:13,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 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 15:05:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-12-13 15:05:13,612 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-12-13 15:05:13,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 15:05:13,613 INFO L428 stractBuchiCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-12-13 15:05:13,613 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 15:05:13,613 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 39 transitions. [2022-12-13 15:05:13,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 16 [2022-12-13 15:05:13,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:05:13,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:05:13,614 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 15:05:13,614 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-12-13 15:05:13,614 INFO L748 eck$LassoCheckResult]: Stem: 1129#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1130#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1134#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1141#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1140#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1139#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1138#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1137#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1127#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1126#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1128#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1149#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1148#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1147#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1144#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1145#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1146#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1124#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1125#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1131#L558-3 [2022-12-13 15:05:13,614 INFO L750 eck$LassoCheckResult]: Loop: 1131#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1155#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1131#L558-3 [2022-12-13 15:05:13,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:05:13,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1545817006, now seen corresponding path program 4 times [2022-12-13 15:05:13,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:05:13,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166295576] [2022-12-13 15:05:13,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:05:13,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:05:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:05:14,278 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:05:14,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:05:14,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166295576] [2022-12-13 15:05:14,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166295576] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:05:14,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755747269] [2022-12-13 15:05:14,279 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:05:14,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:05:14,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:05:14,280 INFO L229 MonitoredProcess]: Starting monitored process 55 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:05:14,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-12-13 15:05:14,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:05:14,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:05:14,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 15:05:14,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:05:14,459 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-13 15:05:14,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-13 15:05:14,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:05:14,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 15:05:14,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:05:14,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 9 [2022-12-13 15:05:14,502 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 9 treesize of output 7 [2022-12-13 15:05:14,726 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-12-13 15:05:14,726 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 72 [2022-12-13 15:05:14,745 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 13 treesize of output 9 [2022-12-13 15:05:14,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 21 treesize of output 16 [2022-12-13 15:05:14,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:05:14,989 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:05:14,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 15:05:15,182 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-12-13 15:05:15,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 83 [2022-12-13 15:05:15,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 31 [2022-12-13 15:05:15,250 INFO L321 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-12-13 15:05:15,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 74 [2022-12-13 15:05:15,309 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2022-12-13 15:05:15,321 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 16 treesize of output 12 [2022-12-13 15:05:15,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-13 15:05:15,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2022-12-13 15:05:15,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2022-12-13 15:05:15,406 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:05:15,409 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 9 treesize of output 7 [2022-12-13 15:05:15,651 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 15:05:15,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2022-12-13 15:05:15,730 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 0 case distinctions, treesize of input 36 treesize of output 16 [2022-12-13 15:05:15,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:05:15,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:06:05,337 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 313 treesize of output 305 [2022-12-13 15:06:05,348 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 239 treesize of output 231 [2022-12-13 15:06:05,361 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 317 treesize of output 309 [2022-12-13 15:06:05,379 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 325 treesize of output 317 [2022-12-13 15:06:05,397 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 83 treesize of output 79 [2022-12-13 15:06:05,476 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:06:05,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755747269] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:06:05,476 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:06:05,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-12-13 15:06:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280006489] [2022-12-13 15:06:05,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:06:05,477 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 15:06:05,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:06:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1702, now seen corresponding path program 3 times [2022-12-13 15:06:05,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:06:05,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615649620] [2022-12-13 15:06:05,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:06:05,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:06:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:06:05,482 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:06:05,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:06:05,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:06:05,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:06:05,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 15:06:05,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=969, Unknown=14, NotChecked=0, Total=1190 [2022-12-13 15:06:05,607 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. cyclomatic complexity: 7 Second operand has 35 states, 34 states have (on average 1.6176470588235294) internal successors, (55), 35 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:06:07,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:06:07,599 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-12-13 15:06:07,600 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 71 transitions. [2022-12-13 15:06:07,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-12-13 15:06:07,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 56 states and 62 transitions. [2022-12-13 15:06:07,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2022-12-13 15:06:07,601 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2022-12-13 15:06:07,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 62 transitions. [2022-12-13 15:06:07,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:06:07,601 INFO L218 hiAutomatonCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-12-13 15:06:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 62 transitions. [2022-12-13 15:06:07,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2022-12-13 15:06:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 44 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 15:06:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-12-13 15:06:07,603 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-12-13 15:06:07,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 15:06:07,604 INFO L428 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-12-13 15:06:07,604 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 15:06:07,604 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2022-12-13 15:06:07,605 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 18 [2022-12-13 15:06:07,605 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:06:07,605 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:06:07,605 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [6, 5, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 15:06:07,606 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 1, 1, 1, 1, 1] [2022-12-13 15:06:07,606 INFO L748 eck$LassoCheckResult]: Stem: 1412#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1413#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1416#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1426#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1425#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1424#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1423#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1421#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1422#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1410#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1411#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1415#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1429#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1435#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1434#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1433#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1430#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1431#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1432#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1408#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1409#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1414#L558-3 [2022-12-13 15:06:07,606 INFO L750 eck$LassoCheckResult]: Loop: 1414#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1449#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1448#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1447#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1445#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1443#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1441#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1406#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1407#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1428#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1436#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1450#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1414#L558-3 [2022-12-13 15:06:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:06:07,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1149433719, now seen corresponding path program 5 times [2022-12-13 15:06:07,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:06:07,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012936744] [2022-12-13 15:06:07,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:06:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:06:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:06:07,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:06:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:06:07,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:06:07,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:06:07,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1788024706, now seen corresponding path program 2 times [2022-12-13 15:06:07,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:06:07,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862556300] [2022-12-13 15:06:07,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:06:07,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:06:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:06:07,661 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:06:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:06:07,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:06:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:06:07,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1472237048, now seen corresponding path program 6 times [2022-12-13 15:06:07,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:06:07,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881759953] [2022-12-13 15:06:07,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:06:07,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:06:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:06:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 59 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:06:08,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:06:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881759953] [2022-12-13 15:06:08,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881759953] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:06:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2015648051] [2022-12-13 15:06:08,647 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 15:06:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:06:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:06:08,648 INFO L229 MonitoredProcess]: Starting monitored process 56 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:06:08,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-12-13 15:06:08,877 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-12-13 15:06:08,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:06:08,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 15:06:08,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:06:08,974 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-13 15:06:08,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-13 15:06:08,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:06:08,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:06:09,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:06:09,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 31 treesize of output 5 [2022-12-13 15:06:09,060 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 5 treesize of output 3 [2022-12-13 15:06:09,290 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-12-13 15:06:09,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 67 [2022-12-13 15:06:09,311 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 5 treesize of output 3 [2022-12-13 15:06:09,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 18 treesize of output 13 [2022-12-13 15:06:09,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-12-13 15:06:09,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:06:09,674 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:06:09,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 15:06:09,869 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-12-13 15:06:09,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 92 treesize of output 83 [2022-12-13 15:06:09,915 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-12-13 15:06:09,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 75 [2022-12-13 15:06:09,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:06:09,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 16 treesize of output 5 [2022-12-13 15:06:09,960 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 5 treesize of output 3 [2022-12-13 15:06:09,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 34 treesize of output 29 [2022-12-13 15:06:10,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 60 [2022-12-13 15:06:10,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 15:06:10,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 25 treesize of output 3 [2022-12-13 15:06:10,296 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-13 15:06:10,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2022-12-13 15:06:10,438 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-13 15:06:10,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2022-12-13 15:06:10,595 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-13 15:06:10,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2022-12-13 15:06:10,754 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-13 15:06:10,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 39 [2022-12-13 15:06:10,966 INFO L321 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-12-13 15:06:10,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 86 [2022-12-13 15:06:11,019 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-12-13 15:06:11,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 75 [2022-12-13 15:06:11,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:06:11,061 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 5 treesize of output 3 [2022-12-13 15:06:11,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 14 treesize of output 11 [2022-12-13 15:06:11,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 21 [2022-12-13 15:06:11,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2022-12-13 15:06:11,142 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 5 treesize of output 3 [2022-12-13 15:06:11,297 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-13 15:06:11,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 35 [2022-12-13 15:06:11,403 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:06:11,403 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 29 treesize of output 21 [2022-12-13 15:06:11,452 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 24 proven. 72 refuted. 4 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:06:11,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:07:25,144 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 1237 treesize of output 1217 [2022-12-13 15:07:25,166 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 1126 treesize of output 1094 [2022-12-13 15:07:25,187 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 1094 treesize of output 1062 [2022-12-13 15:07:25,205 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 1157 treesize of output 1137 [2022-12-13 15:07:25,223 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 1151 treesize of output 1131 [2022-12-13 15:07:25,243 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 83 treesize of output 79 [2022-12-13 15:07:25,358 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 5 proven. 48 refuted. 45 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 15:07:25,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2015648051] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:07:25,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:07:25,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 46 [2022-12-13 15:07:25,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916603886] [2022-12-13 15:07:25,359 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:07:26,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:07:26,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 15:07:26,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=1668, Unknown=70, NotChecked=0, Total=2070 [2022-12-13 15:07:26,175 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 9 Second operand has 46 states, 46 states have (on average 2.0217391304347827) internal successors, (93), 46 states have internal predecessors, (93), 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 15:07:29,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:07:29,571 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-12-13 15:07:29,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 75 states and 85 transitions. [2022-12-13 15:07:29,572 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-12-13 15:07:29,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 75 states to 75 states and 85 transitions. [2022-12-13 15:07:29,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-12-13 15:07:29,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 68 [2022-12-13 15:07:29,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 85 transitions. [2022-12-13 15:07:29,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:07:29,574 INFO L218 hiAutomatonCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-12-13 15:07:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 85 transitions. [2022-12-13 15:07:29,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2022-12-13 15:07:29,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.1470588235294117) internal successors, (78), 67 states have internal predecessors, (78), 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 15:07:29,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-12-13 15:07:29,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-12-13 15:07:29,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 15:07:29,578 INFO L428 stractBuchiCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-12-13 15:07:29,578 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 15:07:29,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 68 states and 78 transitions. [2022-12-13 15:07:29,578 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 20 [2022-12-13 15:07:29,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:07:29,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:07:29,579 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 15:07:29,579 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1, 1] [2022-12-13 15:07:29,579 INFO L748 eck$LassoCheckResult]: Stem: 1827#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1828#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 1834#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1842#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1841#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1840#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1839#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1837#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1838#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1825#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1826#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1831#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1846#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1866#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1865#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1864#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1863#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1862#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1861#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1860#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1859#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1858#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1829#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1830#L558-3 [2022-12-13 15:07:29,579 INFO L750 eck$LassoCheckResult]: Loop: 1830#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1880#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1881#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1885#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1844#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1845#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 1854#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 1888#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 1878#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 1821#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1822#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1887#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1886#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 1884#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 1830#L558-3 [2022-12-13 15:07:29,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:07:29,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1420100956, now seen corresponding path program 7 times [2022-12-13 15:07:29,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:07:29,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238299770] [2022-12-13 15:07:29,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:07:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:07:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:07:29,598 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:07:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:07:29,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:07:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:07:29,611 INFO L85 PathProgramCache]: Analyzing trace with hash 925716135, now seen corresponding path program 3 times [2022-12-13 15:07:29,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:07:29,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595349989] [2022-12-13 15:07:29,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:07:29,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:07:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:07:29,620 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:07:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:07:29,627 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:07:29,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:07:29,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1092901058, now seen corresponding path program 8 times [2022-12-13 15:07:29,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:07:29,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550073728] [2022-12-13 15:07:29,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:07:29,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:07:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:07:30,769 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 77 proven. 59 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:07:30,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:07:30,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550073728] [2022-12-13 15:07:30,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550073728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:07:30,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435134916] [2022-12-13 15:07:30,769 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:07:30,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:07:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:07:30,770 INFO L229 MonitoredProcess]: Starting monitored process 57 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:07:30,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-12-13 15:07:30,896 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:07:30,896 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:07:30,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 15:07:30,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:07:30,906 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 10 treesize of output 8 [2022-12-13 15:07:30,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:07:30,921 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 14 [2022-12-13 15:07:30,925 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:07:30,975 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 28 treesize of output 16 [2022-12-13 15:07:30,996 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 28 treesize of output 16 [2022-12-13 15:07:31,017 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 28 treesize of output 16 [2022-12-13 15:07:31,036 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 28 treesize of output 16 [2022-12-13 15:07:31,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 15:07:31,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:07:31,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 41 [2022-12-13 15:07:31,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-12-13 15:07:31,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 23 treesize of output 18 [2022-12-13 15:07:31,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 18 treesize of output 13 [2022-12-13 15:07:31,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:07:31,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:07:31,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:07:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 73 proven. 63 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:07:31,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:07:44,756 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1119 (Array Int Int)) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_1112 Int) (v_ArrVal_1125 Int) (v_ArrVal_1113 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1112)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse3 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (+ 3 (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) v_ArrVal_1112) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| (+ v_ArrVal_1113 1))) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1119) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1125)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1125 1)) (not (<= (+ 2 v_ArrVal_1113) .cse3)) (< v_ArrVal_1112 .cse3) (< v_ArrVal_1125 4))))))) is different from false [2022-12-13 15:07:57,063 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 293 treesize of output 285 [2022-12-13 15:07:57,072 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 301 treesize of output 293 [2022-12-13 15:07:57,085 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 309 treesize of output 301 [2022-12-13 15:07:57,103 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 209 treesize of output 203 [2022-12-13 15:07:57,119 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 83 treesize of output 79 [2022-12-13 15:07:57,199 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 70 proven. 50 refuted. 0 times theorem prover too weak. 6 trivial. 16 not checked. [2022-12-13 15:07:57,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435134916] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:07:57,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:07:57,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 38 [2022-12-13 15:07:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276240639] [2022-12-13 15:07:57,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:07:58,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:07:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 15:07:58,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1084, Unknown=20, NotChecked=70, Total=1406 [2022-12-13 15:07:58,508 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. cyclomatic complexity: 13 Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 38 states have internal predecessors, (74), 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 15:08:10,850 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 53 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:08:23,656 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 50 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:08:35,871 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 58 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:08:48,003 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 47 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:08:49,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:08:49,647 INFO L93 Difference]: Finished difference Result 112 states and 127 transitions. [2022-12-13 15:08:49,647 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 112 states and 127 transitions. [2022-12-13 15:08:49,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-12-13 15:08:49,648 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 112 states to 112 states and 127 transitions. [2022-12-13 15:08:49,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 103 [2022-12-13 15:08:49,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 103 [2022-12-13 15:08:49,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 112 states and 127 transitions. [2022-12-13 15:08:49,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:08:49,649 INFO L218 hiAutomatonCegarLoop]: Abstraction has 112 states and 127 transitions. [2022-12-13 15:08:49,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states and 127 transitions. [2022-12-13 15:08:49,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 93. [2022-12-13 15:08:49,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 92 states have internal predecessors, (108), 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 15:08:49,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2022-12-13 15:08:49,653 INFO L240 hiAutomatonCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-12-13 15:08:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-12-13 15:08:49,653 INFO L428 stractBuchiCegarLoop]: Abstraction has 93 states and 108 transitions. [2022-12-13 15:08:49,654 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 15:08:49,654 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 93 states and 108 transitions. [2022-12-13 15:08:49,654 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2022-12-13 15:08:49,654 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:08:49,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:08:49,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 15:08:49,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 5, 1, 1, 1, 1, 1] [2022-12-13 15:08:49,655 INFO L748 eck$LassoCheckResult]: Stem: 2336#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 2337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 2344#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2353#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2352#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2351#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2350#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2348#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2349#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2334#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2335#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2388#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2389#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2356#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2340#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2341#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2370#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 2371#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 2366#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2367#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2358#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2359#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2360#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2361#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2338#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2339#L558-3 [2022-12-13 15:08:49,655 INFO L750 eck$LassoCheckResult]: Loop: 2339#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2411#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2410#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2408#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2407#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2406#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2374#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2372#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 2373#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 2416#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 2345#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 2330#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2331#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2355#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2414#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 2413#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 2339#L558-3 [2022-12-13 15:08:49,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:08:49,655 INFO L85 PathProgramCache]: Analyzing trace with hash -461689343, now seen corresponding path program 9 times [2022-12-13 15:08:49,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:08:49,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766021654] [2022-12-13 15:08:49,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:08:49,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:08:49,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:08:49,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:08:49,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:08:49,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:08:49,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:08:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1175867532, now seen corresponding path program 4 times [2022-12-13 15:08:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:08:49,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584672059] [2022-12-13 15:08:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:08:49,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:08:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:08:49,700 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:08:49,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:08:49,711 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:08:49,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:08:49,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1517649548, now seen corresponding path program 10 times [2022-12-13 15:08:49,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:08:49,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420547734] [2022-12-13 15:08:49,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:08:49,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:08:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:08:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 94 proven. 92 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:08:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:08:50,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420547734] [2022-12-13 15:08:50,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420547734] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:08:50,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705789] [2022-12-13 15:08:50,985 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:08:50,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:08:50,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:08:50,986 INFO L229 MonitoredProcess]: Starting monitored process 58 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:08:50,987 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-12-13 15:08:51,096 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:08:51,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:08:51,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 56 conjunts are in the unsatisfiable core [2022-12-13 15:08:51,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:08:51,183 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-13 15:08:51,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-13 15:08:51,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:08:51,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 15:08:51,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 20 [2022-12-13 15:08:51,271 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 15 treesize of output 11 [2022-12-13 15:08:51,429 INFO L321 Elim1Store]: treesize reduction 20, result has 37.5 percent of original size [2022-12-13 15:08:51,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 32 [2022-12-13 15:08:51,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 15:08:51,604 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 15:08:51,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 15:08:51,777 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2022-12-13 15:08:52,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 15:08:52,165 INFO L321 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-12-13 15:08:52,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 63 [2022-12-13 15:08:52,173 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 33 [2022-12-13 15:08:52,204 INFO L321 Elim1Store]: treesize reduction 42, result has 19.2 percent of original size [2022-12-13 15:08:52,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 69 [2022-12-13 15:08:52,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 22 [2022-12-13 15:08:52,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 21 treesize of output 16 [2022-12-13 15:08:52,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:08:52,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-12-13 15:08:52,378 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 17 treesize of output 13 [2022-12-13 15:08:52,481 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:08:52,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:08:52,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:08:52,872 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 92 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:08:52,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:10:31,172 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 399 treesize of output 389 [2022-12-13 15:10:31,190 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 367 treesize of output 357 [2022-12-13 15:10:31,210 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 262 treesize of output 254 [2022-12-13 15:10:31,234 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 369 treesize of output 359 [2022-12-13 15:10:31,254 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 84 treesize of output 76 [2022-12-13 15:10:31,394 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 91 proven. 95 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:10:31,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705789] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:10:31,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:10:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-12-13 15:10:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683558408] [2022-12-13 15:10:31,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:10:33,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:10:33,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 15:10:33,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=485, Invalid=2345, Unknown=32, NotChecked=0, Total=2862 [2022-12-13 15:10:33,145 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. cyclomatic complexity: 18 Second operand has 54 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 54 states have internal predecessors, (98), 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 15:10:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:10:41,732 INFO L93 Difference]: Finished difference Result 168 states and 191 transitions. [2022-12-13 15:10:41,732 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 168 states and 191 transitions. [2022-12-13 15:10:41,733 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2022-12-13 15:10:41,733 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 168 states to 168 states and 191 transitions. [2022-12-13 15:10:41,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 157 [2022-12-13 15:10:41,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 157 [2022-12-13 15:10:41,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 168 states and 191 transitions. [2022-12-13 15:10:41,734 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:10:41,734 INFO L218 hiAutomatonCegarLoop]: Abstraction has 168 states and 191 transitions. [2022-12-13 15:10:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states and 191 transitions. [2022-12-13 15:10:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 120. [2022-12-13 15:10:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.175) internal successors, (141), 119 states have internal predecessors, (141), 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 15:10:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2022-12-13 15:10:41,739 INFO L240 hiAutomatonCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-12-13 15:10:41,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-12-13 15:10:41,740 INFO L428 stractBuchiCegarLoop]: Abstraction has 120 states and 141 transitions. [2022-12-13 15:10:41,740 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 15:10:41,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 141 transitions. [2022-12-13 15:10:41,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 24 [2022-12-13 15:10:41,741 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:10:41,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:10:41,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [9, 8, 2, 2, 2, 1, 1, 1, 1] [2022-12-13 15:10:41,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [7, 6, 1, 1, 1, 1, 1] [2022-12-13 15:10:41,742 INFO L748 eck$LassoCheckResult]: Stem: 3028#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3029#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3035#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3043#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3042#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3041#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3040#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3038#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3039#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3026#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3027#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3069#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3070#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3084#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3085#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3046#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3031#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3032#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3108#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3107#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3052#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3051#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3048#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3049#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3050#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3024#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3025#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3030#L558-3 [2022-12-13 15:10:41,742 INFO L750 eck$LassoCheckResult]: Loop: 3030#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3091#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3092#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3130#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3128#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3125#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3123#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3120#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3121#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3129#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3127#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3124#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3122#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3119#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3117#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3115#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3113#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3099#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3030#L558-3 [2022-12-13 15:10:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -680935066, now seen corresponding path program 11 times [2022-12-13 15:10:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:10:41,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708827643] [2022-12-13 15:10:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:10:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:10:41,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:10:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:10:41,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:10:41,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:41,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1053191473, now seen corresponding path program 5 times [2022-12-13 15:10:41,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:10:41,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760826105] [2022-12-13 15:10:41,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:41,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:10:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:10:41,789 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:10:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:10:41,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:10:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:10:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash 98205526, now seen corresponding path program 12 times [2022-12-13 15:10:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:10:41,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460133964] [2022-12-13 15:10:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:10:41,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:10:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:10:43,431 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 115 proven. 129 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:10:43,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:10:43,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460133964] [2022-12-13 15:10:43,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460133964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:10:43,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503960190] [2022-12-13 15:10:43,432 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 15:10:43,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:10:43,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:10:43,433 INFO L229 MonitoredProcess]: Starting monitored process 59 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:10:43,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-12-13 15:10:43,951 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-12-13 15:10:43,951 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:10:43,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-13 15:10:43,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:10:44,065 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-13 15:10:44,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-13 15:10:44,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:10:44,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 15:10:44,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:10:44,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-12-13 15:10:44,132 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 9 treesize of output 7 [2022-12-13 15:10:44,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:10:44,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:10:44,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-12-13 15:10:44,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 25 treesize of output 13 [2022-12-13 15:10:44,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:10:44,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 16 [2022-12-13 15:10:44,890 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:10:44,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2022-12-13 15:10:45,152 INFO L321 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2022-12-13 15:10:45,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 86 [2022-12-13 15:10:45,216 INFO L321 Elim1Store]: treesize reduction 35, result has 34.0 percent of original size [2022-12-13 15:10:45,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 71 [2022-12-13 15:10:45,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:10:45,284 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 16 treesize of output 12 [2022-12-13 15:10:45,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 21 treesize of output 10 [2022-12-13 15:10:45,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 60 [2022-12-13 15:10:45,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2022-12-13 15:10:45,414 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 5 treesize of output 3 [2022-12-13 15:10:45,654 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:10:45,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 15:10:45,960 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:10:45,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 15:10:46,275 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:10:46,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 15:10:46,595 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:10:46,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 15:10:46,850 INFO L321 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2022-12-13 15:10:46,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 15:10:47,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:10:47,071 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 42 treesize of output 30 [2022-12-13 15:10:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 113 proven. 131 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:10:47,287 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:10:47,402 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 27 treesize of output 23 [2022-12-13 15:12:50,261 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 334 treesize of output 326 [2022-12-13 15:12:50,272 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 264 treesize of output 256 [2022-12-13 15:12:50,286 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 325 treesize of output 317 [2022-12-13 15:12:50,300 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 332 treesize of output 324 [2022-12-13 15:12:50,317 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 23 treesize of output 19 [2022-12-13 15:12:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 90 proven. 157 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 15:12:50,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503960190] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:12:50,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:12:50,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 60 [2022-12-13 15:12:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438738974] [2022-12-13 15:12:50,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:12:53,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:12:53,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-12-13 15:12:53,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=2977, Unknown=37, NotChecked=0, Total=3540 [2022-12-13 15:12:53,824 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. cyclomatic complexity: 24 Second operand has 60 states, 60 states have (on average 1.9833333333333334) internal successors, (119), 60 states have internal predecessors, (119), 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 15:13:04,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:13:04,574 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-12-13 15:13:04,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 176 states and 204 transitions. [2022-12-13 15:13:04,575 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-12-13 15:13:04,575 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 176 states to 176 states and 204 transitions. [2022-12-13 15:13:04,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 163 [2022-12-13 15:13:04,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 163 [2022-12-13 15:13:04,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 176 states and 204 transitions. [2022-12-13 15:13:04,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:13:04,576 INFO L218 hiAutomatonCegarLoop]: Abstraction has 176 states and 204 transitions. [2022-12-13 15:13:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states and 204 transitions. [2022-12-13 15:13:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 149. [2022-12-13 15:13:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 149 states have (on average 1.1879194630872483) internal successors, (177), 148 states have internal predecessors, (177), 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 15:13:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 177 transitions. [2022-12-13 15:13:04,581 INFO L240 hiAutomatonCegarLoop]: Abstraction has 149 states and 177 transitions. [2022-12-13 15:13:04,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-12-13 15:13:04,582 INFO L428 stractBuchiCegarLoop]: Abstraction has 149 states and 177 transitions. [2022-12-13 15:13:04,582 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2022-12-13 15:13:04,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 149 states and 177 transitions. [2022-12-13 15:13:04,583 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-12-13 15:13:04,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:13:04,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:13:04,583 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 5, 3, 3, 3, 3, 2, 1, 1] [2022-12-13 15:13:04,583 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-12-13 15:13:04,584 INFO L748 eck$LassoCheckResult]: Stem: 3803#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 3804#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 3810#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3819#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3818#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3817#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3816#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3814#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3815#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3801#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3802#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3849#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3848#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3847#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3846#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3845#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3844#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3843#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3842#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3841#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3839#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 3840#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3872#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3868#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3866#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3864#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3860#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3857#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3858#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3853#L558-4 [2022-12-13 15:13:04,584 INFO L750 eck$LassoCheckResult]: Loop: 3853#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 3852#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 3851#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 3836#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3837#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 3855#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 3853#L558-4 [2022-12-13 15:13:04,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:13:04,584 INFO L85 PathProgramCache]: Analyzing trace with hash -2129975380, now seen corresponding path program 13 times [2022-12-13 15:13:04,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:13:04,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79390996] [2022-12-13 15:13:04,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:04,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:13:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:13:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 10 proven. 52 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 15:13:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:13:05,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79390996] [2022-12-13 15:13:05,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79390996] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:13:05,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630055286] [2022-12-13 15:13:05,503 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-13 15:13:05,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:13:05,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:13:05,504 INFO L229 MonitoredProcess]: Starting monitored process 60 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:13:05,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-12-13 15:13:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:13:05,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 15:13:05,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:13:05,739 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-13 15:13:05,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-13 15:13:05,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:13:05,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-13 15:13:05,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 9 [2022-12-13 15:13:05,798 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 9 treesize of output 7 [2022-12-13 15:13:05,879 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 15:13:05,880 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 49 treesize of output 47 [2022-12-13 15:13:05,890 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 7 treesize of output 5 [2022-12-13 15:13:05,906 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 5 treesize of output 3 [2022-12-13 15:13:05,911 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-13 15:13:06,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:13:06,121 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 14 [2022-12-13 15:13:06,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:13:06,211 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 28 treesize of output 16 [2022-12-13 15:13:06,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-12-13 15:13:06,406 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 17 treesize of output 13 [2022-12-13 15:13:06,530 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 28 treesize of output 16 [2022-12-13 15:13:06,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:13:06,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 32 [2022-12-13 15:13:06,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-13 15:13:06,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:13:06,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 18 treesize of output 13 [2022-12-13 15:13:06,801 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 15:13:06,801 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 29 treesize of output 17 [2022-12-13 15:13:06,857 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 14 refuted. 7 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:13:06,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:13:07,407 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 68 treesize of output 66 [2022-12-13 15:13:07,411 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 5 treesize of output 3 [2022-12-13 15:13:07,417 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 40 treesize of output 38 [2022-12-13 15:13:07,423 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 39 treesize of output 37 [2022-12-13 15:13:07,429 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 23 treesize of output 19 [2022-12-13 15:13:07,674 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 16 treesize of output 14 [2022-12-13 15:13:07,720 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 35 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-13 15:13:07,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630055286] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:13:07,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:13:07,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 35 [2022-12-13 15:13:07,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749400769] [2022-12-13 15:13:07,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:13:07,721 INFO L753 eck$LassoCheckResult]: stem already infeasible [2022-12-13 15:13:07,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:13:07,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1810417107, now seen corresponding path program 3 times [2022-12-13 15:13:07,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:13:07,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851802111] [2022-12-13 15:13:07,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:07,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:13:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:13:07,728 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:13:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:13:07,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:13:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:13:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 15:13:08,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=988, Unknown=9, NotChecked=0, Total=1260 [2022-12-13 15:13:08,093 INFO L87 Difference]: Start difference. First operand 149 states and 177 transitions. cyclomatic complexity: 31 Second operand has 36 states, 35 states have (on average 2.085714285714286) internal successors, (73), 36 states have internal predecessors, (73), 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 15:13:08,222 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= 1 .cse0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (or .cse1 (exists ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_DerPreprocessor_24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)))) (not .cse1) (= .cse0 1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-12-13 15:13:09,009 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (and (<= 1 .cse0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= .cse0 1) (or .cse1 (exists ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= .cse2 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_DerPreprocessor_24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)))) (not .cse1) (<= 2 .cse3) (= .cse0 1) (<= 3 .cse3) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)))) is different from true [2022-12-13 15:13:09,428 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (.cse0 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (<= 1 .cse0) (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| 0) (<= .cse0 1) (or .cse1 (exists ((v_DerPreprocessor_23 (Array Int Int)) (v_DerPreprocessor_24 (Array Int Int))) (and (= .cse2 (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|)) (= (select v_DerPreprocessor_24 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0)))) (not .cse1) (<= 2 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (= .cse0 1) (= |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0))) is different from true [2022-12-13 15:13:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 15:13:09,741 INFO L93 Difference]: Finished difference Result 155 states and 172 transitions. [2022-12-13 15:13:09,741 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 155 states and 172 transitions. [2022-12-13 15:13:09,742 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-12-13 15:13:09,744 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 155 states to 155 states and 172 transitions. [2022-12-13 15:13:09,744 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 143 [2022-12-13 15:13:09,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2022-12-13 15:13:09,744 INFO L73 IsDeterministic]: Start isDeterministic. Operand 155 states and 172 transitions. [2022-12-13 15:13:09,745 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-12-13 15:13:09,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 155 states and 172 transitions. [2022-12-13 15:13:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states and 172 transitions. [2022-12-13 15:13:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 106. [2022-12-13 15:13:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 105 states have internal predecessors, (123), 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 15:13:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 123 transitions. [2022-12-13 15:13:09,749 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-12-13 15:13:09,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 15:13:09,750 INFO L428 stractBuchiCegarLoop]: Abstraction has 106 states and 123 transitions. [2022-12-13 15:13:09,750 INFO L335 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2022-12-13 15:13:09,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 123 transitions. [2022-12-13 15:13:09,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 26 [2022-12-13 15:13:09,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 15:13:09,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 15:13:09,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [8, 7, 1, 1, 1, 1, 1, 1] [2022-12-13 15:13:09,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [8, 7, 1, 1, 1, 1, 1] [2022-12-13 15:13:09,751 INFO L748 eck$LassoCheckResult]: Stem: 4344#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 4345#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~nondet15#1, main_#t~ret16#1;assume { :begin_inline_test_fun } true;test_fun_#in~x#1, test_fun_#in~y#1 := main_#t~nondet14#1, main_#t~nondet15#1;havoc test_fun_#res#1;havoc test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset, test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset, test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset, test_fun_#t~mem8#1, test_fun_#t~mem11#1, test_fun_#t~mem9#1, test_fun_#t~mem10#1, test_fun_#t~mem12#1, test_fun_#t~mem5#1, test_fun_#t~mem6#1, test_fun_#t~short7#1, test_fun_#t~mem13#1, test_fun_~x#1, test_fun_~y#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, test_fun_~c~0#1.base, test_fun_~c~0#1.offset;test_fun_~x#1 := test_fun_#in~x#1;test_fun_~y#1 := test_fun_#in~y#1;call test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset := test_fun_#t~malloc2#1.base, test_fun_#t~malloc2#1.offset;call test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset := test_fun_#t~malloc3#1.base, test_fun_#t~malloc3#1.offset;call test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset := #Ultimate.allocOnStack(4);test_fun_~c~0#1.base, test_fun_~c~0#1.offset := test_fun_#t~malloc4#1.base, test_fun_#t~malloc4#1.offset;call write~int(test_fun_~x#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_~y#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(0, test_fun_~c~0#1.base, test_fun_~c~0#1.offset, 4); 4349#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 4359#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 4358#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4357#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4356#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4354#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4355#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4342#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4343#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4395#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4396#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4409#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4410#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4438#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4347#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4348#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4363#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4443#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4442#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 4441#L558-4 [2022-12-13 15:13:09,752 INFO L750 eck$LassoCheckResult]: Loop: 4441#L558-4 call test_fun_#t~mem12#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(test_fun_#t~mem12#1 - 2, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem12#1; 4440#L555-5 call test_fun_#t~mem5#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem5#1 >= 0; 4352#L555-1 assume test_fun_#t~short7#1;call test_fun_#t~mem6#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);test_fun_#t~short7#1 := test_fun_#t~mem6#1 < 2147483647; 4338#L555-3 assume !!test_fun_#t~short7#1;havoc test_fun_#t~mem5#1;havoc test_fun_#t~mem6#1;havoc test_fun_#t~short7#1;call test_fun_#t~mem8#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem8#1, test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);havoc test_fun_#t~mem8#1;call write~int(1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4339#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4346#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4340#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4341#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4368#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4380#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4381#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4392#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4393#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4417#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4427#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4425#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4426#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4366#L558-1 assume !!(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1;call test_fun_#t~mem11#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);call write~int(1 + test_fun_#t~mem11#1, test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4);havoc test_fun_#t~mem11#1; 4367#L558-3 call test_fun_#t~mem9#1 := read~int(test_fun_~x_ref~0#1.base, test_fun_~x_ref~0#1.offset, 4);call test_fun_#t~mem10#1 := read~int(test_fun_~y_ref~0#1.base, test_fun_~y_ref~0#1.offset, 4); 4435#L558-1 assume !(test_fun_#t~mem9#1 > test_fun_#t~mem10#1);havoc test_fun_#t~mem9#1;havoc test_fun_#t~mem10#1; 4441#L558-4 [2022-12-13 15:13:09,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:13:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 868223250, now seen corresponding path program 2 times [2022-12-13 15:13:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:13:09,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797491493] [2022-12-13 15:13:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:13:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:13:09,770 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:13:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:13:09,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:13:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:13:09,780 INFO L85 PathProgramCache]: Analyzing trace with hash -557161706, now seen corresponding path program 6 times [2022-12-13 15:13:09,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:13:09,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992522743] [2022-12-13 15:13:09,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:09,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:13:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:13:09,793 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:13:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:13:09,802 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:13:09,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:13:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -380356185, now seen corresponding path program 14 times [2022-12-13 15:13:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:13:09,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356744329] [2022-12-13 15:13:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:13:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:13:09,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:13:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 71 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:13:11,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:13:11,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356744329] [2022-12-13 15:13:11,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356744329] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 15:13:11,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657916686] [2022-12-13 15:13:11,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:13:11,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 15:13:11,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:13:11,511 INFO L229 MonitoredProcess]: Starting monitored process 61 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 15:13:11,512 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48dbd32a-3f04-4806-9141-48d8d284bd45/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-12-13 15:13:11,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 15:13:11,635 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:13:11,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 15:13:11,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:13:11,647 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 10 treesize of output 8 [2022-12-13 15:13:11,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:13:11,669 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 14 [2022-12-13 15:13:11,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-13 15:13:11,749 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 28 treesize of output 16 [2022-12-13 15:13:11,776 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 28 treesize of output 16 [2022-12-13 15:13:11,800 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 28 treesize of output 16 [2022-12-13 15:13:11,824 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 28 treesize of output 16 [2022-12-13 15:13:11,848 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 28 treesize of output 16 [2022-12-13 15:13:11,874 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 28 treesize of output 16 [2022-12-13 15:13:11,894 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 28 treesize of output 16 [2022-12-13 15:13:12,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2022-12-13 15:13:12,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 15:13:12,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 44 [2022-12-13 15:13:12,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 27 treesize of output 22 [2022-12-13 15:13:12,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-12-13 15:13:12,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:13:12,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:13:12,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:13:12,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:13:12,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:13:12,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-12-13 15:13:13,011 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 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-13 15:13:13,076 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 69 proven. 174 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:13:13,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 15:13:26,303 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_1970 Int) (v_ArrVal_1976 Int) (v_ArrVal_1989 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1970)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< v_ArrVal_1970 .cse0) (< v_ArrVal_1989 7) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1976)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1989 1)) (not (<= v_ArrVal_1970 (+ (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1))) (< .cse0 (+ v_ArrVal_1976 1)))))))) is different from false [2022-12-13 15:13:39,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_1970 Int) (v_ArrVal_1976 Int) (v_ArrVal_1989 Int)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1970)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< v_ArrVal_1970 .cse0) (< v_ArrVal_1989 7) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1976)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1989 1)) (< (+ 6 (select .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) v_ArrVal_1970) (< .cse0 (+ v_ArrVal_1976 1)))))))) is different from false [2022-12-13 15:13:39,614 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1978 (Array Int Int)) (|ULTIMATE.start_test_fun_~x_ref~0#1.offset| Int) (v_ArrVal_1970 Int) (v_ArrVal_1976 Int) (v_ArrVal_1989 Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1970)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse3 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (< (+ 7 (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) v_ArrVal_1970) (< v_ArrVal_1970 .cse1) (< v_ArrVal_1989 7) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_1976)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store (select (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_1978) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_ArrVal_1989)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (+ v_ArrVal_1989 1)) (< .cse1 (+ v_ArrVal_1976 1)))))))) is different from false [2022-12-13 15:13:39,666 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 396 treesize of output 388 [2022-12-13 15:13:39,679 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 221 treesize of output 213 [2022-12-13 15:13:39,693 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 128 treesize of output 120 [2022-12-13 15:13:39,713 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 213 treesize of output 205 [2022-12-13 15:13:39,734 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 158 treesize of output 150 [2022-12-13 15:13:39,880 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 66 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 78 not checked. [2022-12-13 15:13:39,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657916686] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 15:13:39,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 15:13:39,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22, 22] total 55 [2022-12-13 15:13:39,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844708873] [2022-12-13 15:13:39,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 15:13:45,803 WARN L233 SmtUtils]: Spent 5.92s on a formula simplification. DAG size of input: 168 DAG size of output: 149 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 15:13:45,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:13:45,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-12-13 15:13:45,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=2192, Unknown=19, NotChecked=306, Total=2970 [2022-12-13 15:13:45,909 INFO L87 Difference]: Start difference. First operand 106 states and 123 transitions. cyclomatic complexity: 20 Second operand has 55 states, 55 states have (on average 1.8363636363636364) internal successors, (101), 55 states have internal predecessors, (101), 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 15:13:58,180 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 50 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:14:10,647 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 54 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:14:23,735 WARN L233 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 57 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:14:36,113 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 52 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:14:48,217 WARN L233 SmtUtils]: Spent 12.04s on a formula simplification. DAG size of input: 47 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:15:00,445 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 63 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:15:12,551 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 57 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:15:24,878 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 50 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:15:37,020 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 53 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:15:49,134 WARN L233 SmtUtils]: Spent 12.05s on a formula simplification. DAG size of input: 47 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:16:01,294 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 60 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:16:13,443 WARN L233 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 64 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:16:25,556 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 57 DAG size of output: 21 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:16:37,875 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 54 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:16:50,014 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 47 DAG size of output: 16 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:17:03,183 WARN L233 SmtUtils]: Spent 12.15s on a formula simplification. DAG size of input: 65 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:17:15,334 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 57 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:17:27,991 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 54 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:17:40,204 WARN L233 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 60 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:17:52,339 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 61 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:18:04,545 WARN L233 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 65 DAG size of output: 22 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:18:16,692 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 52 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:18:29,017 WARN L233 SmtUtils]: Spent 12.07s on a formula simplification. DAG size of input: 48 DAG size of output: 18 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:18:41,307 WARN L233 SmtUtils]: Spent 12.06s on a formula simplification. DAG size of input: 50 DAG size of output: 17 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 15:18:53,439 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 56 DAG size of output: 20 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)