./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 527bcce2 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_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-527bcce [2023-11-21 22:14:24,788 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-21 22:14:24,915 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/config/svcomp-Termination-32bit-Automizer_Default.epf [2023-11-21 22:14:24,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-21 22:14:24,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-21 22:14:24,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-21 22:14:24,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-21 22:14:24,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-21 22:14:24,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-21 22:14:24,969 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-21 22:14:24,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-21 22:14:24,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-21 22:14:24,971 INFO L153 SettingsManager]: * Use SBE=true [2023-11-21 22:14:24,972 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-11-21 22:14:24,974 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-11-21 22:14:24,975 INFO L153 SettingsManager]: * Use old map elimination=false [2023-11-21 22:14:24,977 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2023-11-21 22:14:24,980 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2023-11-21 22:14:24,981 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-11-21 22:14:24,982 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-21 22:14:24,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-11-21 22:14:24,984 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-21 22:14:24,984 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-21 22:14:24,985 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-21 22:14:24,985 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-21 22:14:24,985 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-11-21 22:14:24,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-11-21 22:14:24,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-11-21 22:14:24,987 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-21 22:14:24,987 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-21 22:14:24,989 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-21 22:14:24,989 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-11-21 22:14:24,989 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-21 22:14:24,989 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-21 22:14:24,990 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-21 22:14:24,990 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-21 22:14:24,990 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-21 22:14:24,991 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-11-21 22:14:24,991 INFO L153 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_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/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_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45898d4df949634911027a72c0e1c79e1edaab63547cca5c16238cef1218e556 [2023-11-21 22:14:25,305 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-21 22:14:25,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-21 22:14:25,335 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-21 22:14:25,337 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-21 22:14:25,337 INFO L274 PluginConnector]: CDTParser initialized [2023-11-21 22:14:25,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-21 22:14:29,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-21 22:14:29,248 INFO L384 CDTParser]: Found 1 translation units. [2023-11-21 22:14:29,249 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/sv-benchmarks/c/recursified_loop-simple/recursified_nested_4.c [2023-11-21 22:14:29,258 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/data/044f27019/665bca8c3f104e91a6cb71d79940d68f/FLAG9f4ae9c54 [2023-11-21 22:14:29,276 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/data/044f27019/665bca8c3f104e91a6cb71d79940d68f [2023-11-21 22:14:29,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-21 22:14:29,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-21 22:14:29,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:29,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-21 22:14:29,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-21 22:14:29,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,299 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5961e7c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29, skipping insertion in model container [2023-11-21 22:14:29,299 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,330 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-21 22:14:29,535 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:29,547 INFO L202 MainTranslator]: Completed pre-run [2023-11-21 22:14:29,570 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-21 22:14:29,585 INFO L206 MainTranslator]: Completed translation [2023-11-21 22:14:29,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29 WrapperNode [2023-11-21 22:14:29,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-21 22:14:29,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:29,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-21 22:14:29,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-21 22:14:29,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,604 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,622 INFO L138 Inliner]: procedures = 15, calls = 52, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 67 [2023-11-21 22:14:29,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-21 22:14:29,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-21 22:14:29,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-21 22:14:29,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-21 22:14:29,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,638 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,654 INFO L187 HeapSplitter]: Split 26 memory accesses to 5 slices as follows [2, 6, 6, 6, 6] [2023-11-21 22:14:29,654 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,655 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,663 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,670 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,674 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-21 22:14:29,675 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-21 22:14:29,675 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-21 22:14:29,675 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-21 22:14:29,676 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (1/1) ... [2023-11-21 22:14:29,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-11-21 22:14:29,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:29,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2023-11-21 22:14:29,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2023-11-21 22:14:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-21 22:14:29,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-21 22:14:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-21 22:14:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-21 22:14:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-21 22:14:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-21 22:14:29,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-21 22:14:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-21 22:14:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-21 22:14:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-21 22:14:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-21 22:14:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-21 22:14:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2023-11-21 22:14:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2023-11-21 22:14:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2023-11-21 22:14:29,752 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2023-11-21 22:14:29,752 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-21 22:14:29,752 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-21 22:14:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_25_0 [2023-11-21 22:14:29,753 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_25_0 [2023-11-21 22:14:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-21 22:14:29,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-21 22:14:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-21 22:14:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-21 22:14:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-21 22:14:29,755 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-21 22:14:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-21 22:14:29,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-21 22:14:29,874 INFO L240 CfgBuilder]: Building ICFG [2023-11-21 22:14:29,876 INFO L266 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-21 22:14:30,186 INFO L281 CfgBuilder]: Performing block encoding [2023-11-21 22:14:30,201 INFO L303 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-21 22:14:30,204 INFO L308 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-21 22:14:30,206 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:30 BoogieIcfgContainer [2023-11-21 22:14:30,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-21 22:14:30,208 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-11-21 22:14:30,208 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-11-21 22:14:30,212 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-11-21 22:14:30,213 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:14:30,213 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.11 10:14:29" (1/3) ... [2023-11-21 22:14:30,214 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b0cc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:14:30, skipping insertion in model container [2023-11-21 22:14:30,214 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:14:30,215 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 10:14:29" (2/3) ... [2023-11-21 22:14:30,217 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b0cc98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.11 10:14:30, skipping insertion in model container [2023-11-21 22:14:30,217 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-11-21 22:14:30,218 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 10:14:30" (3/3) ... [2023-11-21 22:14:30,219 INFO L332 chiAutomizerObserver]: Analyzing ICFG recursified_nested_4.c [2023-11-21 22:14:30,283 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-11-21 22:14:30,283 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-11-21 22:14:30,283 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-11-21 22:14:30,284 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-11-21 22:14:30,284 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-11-21 22:14:30,284 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-11-21 22:14:30,284 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-11-21 22:14:30,284 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-11-21 22:14:30,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-21 22:14:30,350 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:30,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:30,353 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:30,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:30,371 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:30,371 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-11-21 22:14:30,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-21 22:14:30,385 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:30,385 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:30,385 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:30,386 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:30,386 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:30,395 INFO L748 eck$LassoCheckResult]: Stem: 37#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 11#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 29#L107true call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 33#$Ultimate##0true [2023-11-21 22:14:30,396 INFO L750 eck$LassoCheckResult]: Loop: 33#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 10#L81true assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 21#L87true call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 20#$Ultimate##0true ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 24#L61true assume !(#t~mem10 < 6);havoc #t~mem10; 6#L61-1true assume true; 9#func_to_recursive_line_23_to_24_0EXITtrue >#88#return; 15#L87-1true call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 7#L92true call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 33#$Ultimate##0true [2023-11-21 22:14:30,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 1 times [2023-11-21 22:14:30,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:30,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646468151] [2023-11-21 22:14:30,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:30,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:30,624 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:30,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:30,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:30,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:30,674 INFO L85 PathProgramCache]: Analyzing trace with hash -448633028, now seen corresponding path program 1 times [2023-11-21 22:14:30,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:30,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121993064] [2023-11-21 22:14:30,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:30,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-21 22:14:31,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121993064] [2023-11-21 22:14:31,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121993064] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:31,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:31,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:14:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313779513] [2023-11-21 22:14:31,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:31,155 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:14:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:31,207 INFO L87 Difference]: Start difference. First operand has 41 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 32 states have internal predecessors, (36), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-21 22:14:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:31,448 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2023-11-21 22:14:31,450 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2023-11-21 22:14:31,455 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:31,461 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 33 states and 41 transitions. [2023-11-21 22:14:31,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-21 22:14:31,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-21 22:14:31,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 41 transitions. [2023-11-21 22:14:31,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:31,465 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 41 transitions. [2023-11-21 22:14:31,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 41 transitions. [2023-11-21 22:14:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2023-11-21 22:14:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 20 states have internal predecessors, (20), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-11-21 22:14:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2023-11-21 22:14:31,499 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-21 22:14:31,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:14:31,504 INFO L428 stractBuchiCegarLoop]: Abstraction has 29 states and 35 transitions. [2023-11-21 22:14:31,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-11-21 22:14:31,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 35 transitions. [2023-11-21 22:14:31,506 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:31,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:31,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:31,507 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:31,507 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:31,508 INFO L748 eck$LassoCheckResult]: Stem: 136#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 124#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 120#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 121#$Ultimate##0 [2023-11-21 22:14:31,508 INFO L750 eck$LassoCheckResult]: Loop: 121#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 123#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 110#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 131#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 113#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 125#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 112#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 116#L41-1 assume true; 132#func_to_recursive_line_24_to_25_0EXIT >#84#return; 134#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 109#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 111#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 131#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 117#L61-1 assume true; 118#func_to_recursive_line_23_to_24_0EXIT >#86#return; 122#L61-1 assume true; 137#func_to_recursive_line_23_to_24_0EXIT >#88#return; 128#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 119#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 121#$Ultimate##0 [2023-11-21 22:14:31,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:31,509 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 2 times [2023-11-21 22:14:31,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:31,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776345482] [2023-11-21 22:14:31,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:31,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:31,530 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:31,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:31,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:31,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1860565822, now seen corresponding path program 1 times [2023-11-21 22:14:31,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:31,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696694414] [2023-11-21 22:14:31,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:31,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:31,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:31,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-21 22:14:32,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:32,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696694414] [2023-11-21 22:14:32,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696694414] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:32,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:32,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:14:32,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370571498] [2023-11-21 22:14:32,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:32,099 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:32,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:32,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:14:32,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:32,102 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. cyclomatic complexity: 10 Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-21 22:14:32,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:32,233 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2023-11-21 22:14:32,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 40 transitions. [2023-11-21 22:14:32,237 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:32,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 40 transitions. [2023-11-21 22:14:32,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-21 22:14:32,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-21 22:14:32,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 40 transitions. [2023-11-21 22:14:32,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:32,243 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 40 transitions. [2023-11-21 22:14:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 40 transitions. [2023-11-21 22:14:32,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-21 22:14:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 21 states have internal predecessors, (21), 8 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2023-11-21 22:14:32,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-21 22:14:32,255 INFO L240 hiAutomatonCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-21 22:14:32,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:14:32,256 INFO L428 stractBuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-21 22:14:32,257 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-11-21 22:14:32,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2023-11-21 22:14:32,258 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:32,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:32,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:32,259 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:32,259 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:32,260 INFO L748 eck$LassoCheckResult]: Stem: 235#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 222#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 218#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 219#$Ultimate##0 [2023-11-21 22:14:32,260 INFO L750 eck$LassoCheckResult]: Loop: 219#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 221#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 208#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 209#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 229#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 212#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 223#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 210#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 213#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 225#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 236#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 227#L25-1 assume true; 228#func_to_recursive_line_25_to_25_0EXIT >#80#return; 232#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 211#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 223#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 210#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 214#L41-1 assume true; 234#func_to_recursive_line_24_to_25_0EXIT >#82#return; 230#L41-1 assume true; 231#func_to_recursive_line_24_to_25_0EXIT >#84#return; 233#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 207#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 209#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 229#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 215#L61-1 assume true; 216#func_to_recursive_line_23_to_24_0EXIT >#86#return; 220#L61-1 assume true; 237#func_to_recursive_line_23_to_24_0EXIT >#88#return; 226#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 217#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 219#$Ultimate##0 [2023-11-21 22:14:32,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:32,261 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 3 times [2023-11-21 22:14:32,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:32,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231678823] [2023-11-21 22:14:32,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:32,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:32,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:32,278 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:32,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:32,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1780666575, now seen corresponding path program 1 times [2023-11-21 22:14:32,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:32,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420309512] [2023-11-21 22:14:32,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:32,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:32,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:32,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-21 22:14:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-11-21 22:14:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:32,949 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-21 22:14:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:32,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420309512] [2023-11-21 22:14:32,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420309512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-21 22:14:32,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-21 22:14:32,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-21 22:14:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851019916] [2023-11-21 22:14:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-21 22:14:32,953 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:32,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:32,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-21 22:14:32,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-21 22:14:32,956 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 10 Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (5), 1 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-21 22:14:33,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:33,103 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2023-11-21 22:14:33,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 39 transitions. [2023-11-21 22:14:33,110 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:33,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 33 states and 39 transitions. [2023-11-21 22:14:33,114 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2023-11-21 22:14:33,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2023-11-21 22:14:33,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 39 transitions. [2023-11-21 22:14:33,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:33,116 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-21 22:14:33,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 39 transitions. [2023-11-21 22:14:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-11-21 22:14:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 22 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2023-11-21 22:14:33,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-21 22:14:33,126 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-21 22:14:33,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-21 22:14:33,128 INFO L428 stractBuchiCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-21 22:14:33,128 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-11-21 22:14:33,128 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 39 transitions. [2023-11-21 22:14:33,129 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:33,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:33,130 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:33,132 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:33,132 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:33,133 INFO L748 eck$LassoCheckResult]: Stem: 365#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 352#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 348#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 349#$Ultimate##0 [2023-11-21 22:14:33,133 INFO L750 eck$LassoCheckResult]: Loop: 349#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 351#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 338#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 339#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 359#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 342#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 353#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 340#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 343#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 355#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 366#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 354#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 355#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 366#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 357#L25-1 assume true; 358#func_to_recursive_line_25_to_25_0EXIT >#92#return; 361#L25-1 assume true; 367#func_to_recursive_line_25_to_25_0EXIT >#80#return; 362#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 341#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 353#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 340#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 344#L41-1 assume true; 360#func_to_recursive_line_24_to_25_0EXIT >#82#return; 364#L41-1 assume true; 369#func_to_recursive_line_24_to_25_0EXIT >#84#return; 363#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 337#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 339#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 359#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 345#L61-1 assume true; 346#func_to_recursive_line_23_to_24_0EXIT >#86#return; 350#L61-1 assume true; 368#func_to_recursive_line_23_to_24_0EXIT >#88#return; 356#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 347#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 349#$Ultimate##0 [2023-11-21 22:14:33,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 4 times [2023-11-21 22:14:33,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:33,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66452323] [2023-11-21 22:14:33,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:33,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:33,152 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:33,167 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:33,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:33,168 INFO L85 PathProgramCache]: Analyzing trace with hash -971158242, now seen corresponding path program 1 times [2023-11-21 22:14:33,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:33,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251525911] [2023-11-21 22:14:33,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:33,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-21 22:14:34,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:34,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-21 22:14:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:34,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-21 22:14:34,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:34,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251525911] [2023-11-21 22:14:34,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251525911] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:34,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977565294] [2023-11-21 22:14:34,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:34,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:34,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:34,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:34,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-21 22:14:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:34,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-21 22:14:34,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:34,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:14:34,739 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-21 22:14:34,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:35,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977565294] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:35,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:14:35,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-21 22:14:35,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642686134] [2023-11-21 22:14:35,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:35,549 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:35,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:35,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-21 22:14:35,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2023-11-21 22:14:35,551 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. cyclomatic complexity: 10 Second operand has 16 states, 12 states have (on average 3.0) internal successors, (36), 15 states have internal predecessors, (36), 8 states have call successors, (13), 4 states have call predecessors, (13), 7 states have return successors, (11), 5 states have call predecessors, (11), 8 states have call successors, (11) [2023-11-21 22:14:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:36,075 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2023-11-21 22:14:36,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2023-11-21 22:14:36,076 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:36,078 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 37 states and 43 transitions. [2023-11-21 22:14:36,078 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2023-11-21 22:14:36,078 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2023-11-21 22:14:36,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 43 transitions. [2023-11-21 22:14:36,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:36,079 INFO L218 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-21 22:14:36,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 43 transitions. [2023-11-21 22:14:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-21 22:14:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 24 states have internal predecessors, (24), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (11), 8 states have call predecessors, (11), 6 states have call successors, (11) [2023-11-21 22:14:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2023-11-21 22:14:36,084 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-21 22:14:36,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-21 22:14:36,086 INFO L428 stractBuchiCegarLoop]: Abstraction has 37 states and 43 transitions. [2023-11-21 22:14:36,086 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-11-21 22:14:36,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 43 transitions. [2023-11-21 22:14:36,087 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:36,087 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:36,087 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:36,089 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:36,090 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [6, 6, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:36,090 INFO L748 eck$LassoCheckResult]: Stem: 727#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 715#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 711#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 712#$Ultimate##0 [2023-11-21 22:14:36,090 INFO L750 eck$LassoCheckResult]: Loop: 712#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 714#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 701#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 702#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 722#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 705#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 716#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 703#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 706#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 729#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 717#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 729#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 717#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 729#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 720#L25-1 assume true; 721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 724#L25-1 assume true; 733#func_to_recursive_line_25_to_25_0EXIT >#92#return; 731#L25-1 assume true; 730#func_to_recursive_line_25_to_25_0EXIT >#80#return; 725#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 704#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 716#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 703#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 706#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 729#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 717#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 729#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 717#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 718#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 729#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 720#L25-1 assume true; 721#func_to_recursive_line_25_to_25_0EXIT >#92#return; 724#L25-1 assume true; 733#func_to_recursive_line_25_to_25_0EXIT >#92#return; 731#L25-1 assume true; 730#func_to_recursive_line_25_to_25_0EXIT >#80#return; 725#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 704#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 716#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 703#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 707#L41-1 assume true; 723#func_to_recursive_line_24_to_25_0EXIT >#82#return; 728#L41-1 assume true; 736#func_to_recursive_line_24_to_25_0EXIT >#82#return; 735#L41-1 assume true; 734#func_to_recursive_line_24_to_25_0EXIT >#84#return; 726#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 700#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 702#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 722#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 708#L61-1 assume true; 709#func_to_recursive_line_23_to_24_0EXIT >#86#return; 713#L61-1 assume true; 732#func_to_recursive_line_23_to_24_0EXIT >#88#return; 719#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 710#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 712#$Ultimate##0 [2023-11-21 22:14:36,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:36,091 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 5 times [2023-11-21 22:14:36,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:36,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268545986] [2023-11-21 22:14:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:36,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:36,106 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:36,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:36,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:36,116 INFO L85 PathProgramCache]: Analyzing trace with hash 933934638, now seen corresponding path program 2 times [2023-11-21 22:14:36,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:36,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061936339] [2023-11-21 22:14:36,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:36,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:36,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:37,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:37,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:37,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:37,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:38,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:38,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 22:14:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:38,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-21 22:14:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-21 22:14:38,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 42 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-21 22:14:38,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:38,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061936339] [2023-11-21 22:14:38,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061936339] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:38,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731527364] [2023-11-21 22:14:38,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-21 22:14:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:38,450 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:38,481 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-21 22:14:38,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-21 22:14:38,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:14:38,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-21 22:14:38,658 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:38,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:14:38,939 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 47 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-21 22:14:38,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:40,203 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-21 22:14:40,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731527364] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:14:40,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:14:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 14] total 30 [2023-11-21 22:14:40,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723491397] [2023-11-21 22:14:40,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:40,206 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-21 22:14:40,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=706, Unknown=0, NotChecked=0, Total=870 [2023-11-21 22:14:40,208 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. cyclomatic complexity: 10 Second operand has 30 states, 22 states have (on average 2.6363636363636362) internal successors, (58), 25 states have internal predecessors, (58), 10 states have call successors, (27), 7 states have call predecessors, (27), 9 states have return successors, (20), 7 states have call predecessors, (20), 10 states have call successors, (20) [2023-11-21 22:14:40,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:40,675 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2023-11-21 22:14:40,676 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 47 transitions. [2023-11-21 22:14:40,677 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:40,678 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 47 transitions. [2023-11-21 22:14:40,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2023-11-21 22:14:40,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2023-11-21 22:14:40,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 47 transitions. [2023-11-21 22:14:40,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:40,680 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-21 22:14:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 47 transitions. [2023-11-21 22:14:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-21 22:14:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 26 states have internal predecessors, (26), 8 states have call successors, (8), 4 states have call predecessors, (8), 10 states have return successors, (13), 10 states have call predecessors, (13), 6 states have call successors, (13) [2023-11-21 22:14:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2023-11-21 22:14:40,685 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-21 22:14:40,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-21 22:14:40,689 INFO L428 stractBuchiCegarLoop]: Abstraction has 41 states and 47 transitions. [2023-11-21 22:14:40,689 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-11-21 22:14:40,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 47 transitions. [2023-11-21 22:14:40,690 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:40,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:40,691 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:40,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:40,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:40,694 INFO L748 eck$LassoCheckResult]: Stem: 1408#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 1394#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 1390#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 1391#$Ultimate##0 [2023-11-21 22:14:40,694 INFO L750 eck$LassoCheckResult]: Loop: 1391#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 1393#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 1380#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1381#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 1401#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 1384#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1395#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1382#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 1385#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1399#L25-1 assume true; 1400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1403#L25-1 assume true; 1416#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1415#L25-1 assume true; 1414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1413#L25-1 assume true; 1412#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1410#L25-1 assume true; 1409#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1404#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1395#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1382#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 1385#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 1396#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 1397#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 1407#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 1399#L25-1 assume true; 1400#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1403#L25-1 assume true; 1416#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1415#L25-1 assume true; 1414#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1413#L25-1 assume true; 1412#func_to_recursive_line_25_to_25_0EXIT >#92#return; 1410#L25-1 assume true; 1409#func_to_recursive_line_25_to_25_0EXIT >#80#return; 1404#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 1383#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 1395#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 1382#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 1386#L41-1 assume true; 1402#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1406#L41-1 assume true; 1419#func_to_recursive_line_24_to_25_0EXIT >#82#return; 1418#L41-1 assume true; 1417#func_to_recursive_line_24_to_25_0EXIT >#84#return; 1405#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 1379#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 1381#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 1401#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 1387#L61-1 assume true; 1388#func_to_recursive_line_23_to_24_0EXIT >#86#return; 1392#L61-1 assume true; 1411#func_to_recursive_line_23_to_24_0EXIT >#88#return; 1398#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 1389#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 1391#$Ultimate##0 [2023-11-21 22:14:40,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 6 times [2023-11-21 22:14:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:40,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805643277] [2023-11-21 22:14:40,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:40,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:40,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:40,720 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:40,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash 571812142, now seen corresponding path program 3 times [2023-11-21 22:14:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:40,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099105143] [2023-11-21 22:14:40,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:40,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:41,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:43,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-21 22:14:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-21 22:14:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-21 22:14:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 12 proven. 118 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-11-21 22:14:44,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:44,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099105143] [2023-11-21 22:14:44,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099105143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:44,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813283805] [2023-11-21 22:14:44,710 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-21 22:14:44,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:44,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:44,716 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:44,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-21 22:14:45,062 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2023-11-21 22:14:45,062 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:14:45,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 77 conjunts are in the unsatisfiable core [2023-11-21 22:14:45,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:45,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-21 22:14:45,547 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 125 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-11-21 22:14:45,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 125 proven. 46 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-21 22:14:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813283805] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-21 22:14:48,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-21 22:14:48,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 22] total 43 [2023-11-21 22:14:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429526719] [2023-11-21 22:14:48,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:48,386 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:48,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-21 22:14:48,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1512, Unknown=0, NotChecked=0, Total=1806 [2023-11-21 22:14:48,389 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. cyclomatic complexity: 10 Second operand has 43 states, 32 states have (on average 2.09375) internal successors, (67), 36 states have internal predecessors, (67), 15 states have call successors, (30), 9 states have call predecessors, (30), 13 states have return successors, (29), 12 states have call predecessors, (29), 15 states have call successors, (29) [2023-11-21 22:14:49,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:49,190 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-11-21 22:14:49,191 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 51 transitions. [2023-11-21 22:14:49,192 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:49,193 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 51 transitions. [2023-11-21 22:14:49,193 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-11-21 22:14:49,193 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-11-21 22:14:49,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 51 transitions. [2023-11-21 22:14:49,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:49,194 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-21 22:14:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 51 transitions. [2023-11-21 22:14:49,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-21 22:14:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.12) internal successors, (28), 28 states have internal predecessors, (28), 8 states have call successors, (8), 4 states have call predecessors, (8), 12 states have return successors, (15), 12 states have call predecessors, (15), 6 states have call successors, (15) [2023-11-21 22:14:49,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-11-21 22:14:49,209 INFO L240 hiAutomatonCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-21 22:14:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:14:49,210 INFO L428 stractBuchiCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-11-21 22:14:49,210 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-11-21 22:14:49,210 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 51 transitions. [2023-11-21 22:14:49,211 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:49,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:49,211 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:49,213 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:49,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [14, 14, 12, 12, 12, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:49,214 INFO L748 eck$LassoCheckResult]: Stem: 2374#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 2360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 2356#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 2357#$Ultimate##0 [2023-11-21 22:14:49,214 INFO L750 eck$LassoCheckResult]: Loop: 2357#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 2359#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 2346#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2347#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 2367#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 2350#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 2348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 2351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2365#L25-1 assume true; 2366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2369#L25-1 assume true; 2388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2387#L25-1 assume true; 2386#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2383#L25-1 assume true; 2382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2381#L25-1 assume true; 2380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2379#L25-1 assume true; 2378#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2376#L25-1 assume true; 2375#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2349#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 2348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 2351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 2362#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 2363#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 2372#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 2365#L25-1 assume true; 2366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2369#L25-1 assume true; 2388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2387#L25-1 assume true; 2386#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2383#L25-1 assume true; 2382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2381#L25-1 assume true; 2380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2379#L25-1 assume true; 2378#func_to_recursive_line_25_to_25_0EXIT >#92#return; 2376#L25-1 assume true; 2375#func_to_recursive_line_25_to_25_0EXIT >#80#return; 2370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 2349#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 2361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 2348#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 2352#L41-1 assume true; 2368#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2373#L41-1 assume true; 2389#func_to_recursive_line_24_to_25_0EXIT >#82#return; 2385#L41-1 assume true; 2384#func_to_recursive_line_24_to_25_0EXIT >#84#return; 2371#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 2345#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 2347#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 2367#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 2353#L61-1 assume true; 2354#func_to_recursive_line_23_to_24_0EXIT >#86#return; 2358#L61-1 assume true; 2377#func_to_recursive_line_23_to_24_0EXIT >#88#return; 2364#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 2355#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 2357#$Ultimate##0 [2023-11-21 22:14:49,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:49,215 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 7 times [2023-11-21 22:14:49,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:49,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192243499] [2023-11-21 22:14:49,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:49,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:49,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:49,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:49,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:49,234 INFO L85 PathProgramCache]: Analyzing trace with hash 174242606, now seen corresponding path program 4 times [2023-11-21 22:14:49,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:49,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989425205] [2023-11-21 22:14:49,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:49,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:49,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:50,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:51,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:52,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:14:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:14:53,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:14:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-21 22:14:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:14:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2023-11-21 22:14:53,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:14:53,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989425205] [2023-11-21 22:14:53,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989425205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:53,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73277682] [2023-11-21 22:14:53,659 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-21 22:14:53,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:14:53,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:14:53,664 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:14:53,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-21 22:14:53,931 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-21 22:14:53,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-21 22:14:53,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-21 22:14:53,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-21 22:14:53,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-21 22:14:54,301 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2023-11-21 22:14:54,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-21 22:14:55,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73277682] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:14:55,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-21 22:14:55,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2023-11-21 22:14:55,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306175619] [2023-11-21 22:14:55,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-21 22:14:55,324 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-11-21 22:14:55,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-21 22:14:55,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-21 22:14:55,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2023-11-21 22:14:55,325 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. cyclomatic complexity: 10 Second operand has 20 states, 15 states have (on average 2.533333333333333) internal successors, (38), 18 states have internal predecessors, (38), 10 states have call successors, (13), 3 states have call predecessors, (13), 9 states have return successors, (13), 8 states have call predecessors, (13), 10 states have call successors, (13) [2023-11-21 22:14:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-21 22:14:55,898 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2023-11-21 22:14:55,898 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 55 transitions. [2023-11-21 22:14:55,899 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:55,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 49 states and 55 transitions. [2023-11-21 22:14:55,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2023-11-21 22:14:55,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2023-11-21 22:14:55,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 55 transitions. [2023-11-21 22:14:55,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-21 22:14:55,902 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-21 22:14:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 55 transitions. [2023-11-21 22:14:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-21 22:14:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 30 states have internal predecessors, (30), 8 states have call successors, (8), 4 states have call predecessors, (8), 14 states have return successors, (17), 14 states have call predecessors, (17), 6 states have call successors, (17) [2023-11-21 22:14:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2023-11-21 22:14:55,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-21 22:14:55,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-21 22:14:55,908 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 55 transitions. [2023-11-21 22:14:55,908 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-11-21 22:14:55,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 55 transitions. [2023-11-21 22:14:55,909 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 18 [2023-11-21 22:14:55,909 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-11-21 22:14:55,910 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-11-21 22:14:55,913 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-11-21 22:14:55,914 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [42, 42, 36, 36, 36, 8, 8, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-21 22:14:55,914 INFO L748 eck$LassoCheckResult]: Stem: 3373#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); 3360#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem16#1, main_#t~mem17#1, main_#t~short18#1, main_#t~mem19#1, main_#t~short20#1, main_#t~mem21#1, main_#t~short22#1, main_~#a~0#1.base, main_~#a~0#1.offset, main_~#b~0#1.base, main_~#b~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset;call main_~#a~0#1.base, main_~#a~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#2(6, main_~#a~0#1.base, main_~#a~0#1.offset, 4);call main_~#b~0#1.base, main_~#b~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#1(6, main_~#b~0#1.base, main_~#b~0#1.offset, 4);call main_~#c~0#1.base, main_~#c~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#4(6, main_~#c~0#1.base, main_~#c~0#1.offset, 4);call main_~#d~0#1.base, main_~#d~0#1.offset := #Ultimate.allocOnStack(4);call write~init~int#3(6, main_~#d~0#1.base, main_~#d~0#1.offset, 4);call write~int#2(0, main_~#a~0#1.base, main_~#a~0#1.offset, 4); 3356#L107 call func_to_recursive_line_22_to_23_0(main_~#b~0#1.base, main_~#b~0#1.offset, main_~#d~0#1.base, main_~#d~0#1.offset, main_~#c~0#1.base, main_~#c~0#1.offset, main_~#a~0#1.base, main_~#a~0#1.offset);< 3357#$Ultimate##0 [2023-11-21 22:14:55,915 INFO L750 eck$LassoCheckResult]: Loop: 3357#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~a.base, ~a.offset := #in~a.base, #in~a.offset;call #t~mem13 := read~int#2(~a.base, ~a.offset, 4); 3359#L81 assume #t~mem13 < 6;havoc #t~mem13;call write~int#1(0, ~b.base, ~b.offset, 4); 3346#L87 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3347#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 3367#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 3349#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 3351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3365#L25-1 assume true; 3366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3369#L25-1 assume true; 3390#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3389#L25-1 assume true; 3388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3385#L25-1 assume true; 3384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3383#L25-1 assume true; 3382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3381#L25-1 assume true; 3380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3378#L25-1 assume true; 3377#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3350#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 3351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3365#L25-1 assume true; 3366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3369#L25-1 assume true; 3390#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3389#L25-1 assume true; 3388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3385#L25-1 assume true; 3384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3383#L25-1 assume true; 3382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3381#L25-1 assume true; 3380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3378#L25-1 assume true; 3377#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3350#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 3351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3365#L25-1 assume true; 3366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3369#L25-1 assume true; 3390#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3389#L25-1 assume true; 3388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3385#L25-1 assume true; 3384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3383#L25-1 assume true; 3382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3381#L25-1 assume true; 3380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3378#L25-1 assume true; 3377#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3350#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3352#L41-1 assume true; 3368#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3372#L41-1 assume true; 3393#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3392#L41-1 assume true; 3391#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3387#L41-1 assume true; 3386#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3371#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3345#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3347#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 3367#L61 assume #t~mem10 < 6;havoc #t~mem10;call write~int#4(0, ~c.base, ~c.offset, 4); 3349#L67 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 3351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3365#L25-1 assume true; 3366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3369#L25-1 assume true; 3390#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3389#L25-1 assume true; 3388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3385#L25-1 assume true; 3384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3383#L25-1 assume true; 3382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3381#L25-1 assume true; 3380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3378#L25-1 assume true; 3377#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3350#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 3351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3365#L25-1 assume true; 3366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3369#L25-1 assume true; 3390#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3389#L25-1 assume true; 3388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3385#L25-1 assume true; 3384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3383#L25-1 assume true; 3382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3381#L25-1 assume true; 3380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3378#L25-1 assume true; 3377#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3350#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume #t~mem7 < 6;havoc #t~mem7;call write~int#3(0, ~d.base, ~d.offset, 4); 3351#L47 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume #t~mem4 < 6;havoc #t~mem4;call #t~mem5 := read~int#3(~d.base, ~d.offset, 4);#t~pre6 := 1 + #t~mem5;call write~int#3(1 + #t~mem5, ~d.base, ~d.offset, 4);havoc #t~mem5;havoc #t~pre6; 3363#L32 call func_to_recursive_line_25_to_25_0(~d.base, ~d.offset);< 3364#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem4 := read~int#3(~d.base, ~d.offset, 4); 3374#L25 assume !(#t~mem4 < 6);havoc #t~mem4; 3365#L25-1 assume true; 3366#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3369#L25-1 assume true; 3390#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3389#L25-1 assume true; 3388#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3385#L25-1 assume true; 3384#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3383#L25-1 assume true; 3382#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3381#L25-1 assume true; 3380#func_to_recursive_line_25_to_25_0EXIT >#92#return; 3378#L25-1 assume true; 3377#func_to_recursive_line_25_to_25_0EXIT >#80#return; 3370#L47-1 call #t~mem8 := read~int#4(~c.base, ~c.offset, 4);#t~pre9 := 1 + #t~mem8;call write~int#4(1 + #t~mem8, ~c.base, ~c.offset, 4);havoc #t~mem8;havoc #t~pre9; 3350#L52 call func_to_recursive_line_24_to_25_0(~d.base, ~d.offset, ~c.base, ~c.offset);< 3361#$Ultimate##0 ~d.base, ~d.offset := #in~d.base, #in~d.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;call #t~mem7 := read~int#4(~c.base, ~c.offset, 4); 3348#L41 assume !(#t~mem7 < 6);havoc #t~mem7; 3352#L41-1 assume true; 3368#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3372#L41-1 assume true; 3393#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3392#L41-1 assume true; 3391#func_to_recursive_line_24_to_25_0EXIT >#82#return; 3387#L41-1 assume true; 3386#func_to_recursive_line_24_to_25_0EXIT >#84#return; 3371#L67-1 call #t~mem11 := read~int#1(~b.base, ~b.offset, 4);#t~pre12 := 1 + #t~mem11;call write~int#1(1 + #t~mem11, ~b.base, ~b.offset, 4);havoc #t~mem11;havoc #t~pre12; 3345#L72 call func_to_recursive_line_23_to_24_0(~b.base, ~b.offset, ~c.base, ~c.offset, ~d.base, ~d.offset);< 3347#$Ultimate##0 ~b.base, ~b.offset := #in~b.base, #in~b.offset;~c.base, ~c.offset := #in~c.base, #in~c.offset;~d.base, ~d.offset := #in~d.base, #in~d.offset;call #t~mem10 := read~int#1(~b.base, ~b.offset, 4); 3367#L61 assume !(#t~mem10 < 6);havoc #t~mem10; 3353#L61-1 assume true; 3354#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3358#L61-1 assume true; 3379#func_to_recursive_line_23_to_24_0EXIT >#86#return; 3376#L61-1 assume true; 3375#func_to_recursive_line_23_to_24_0EXIT >#88#return; 3362#L87-1 call #t~mem14 := read~int#2(~a.base, ~a.offset, 4);#t~pre15 := 1 + #t~mem14;call write~int#2(1 + #t~mem14, ~a.base, ~a.offset, 4);havoc #t~mem14;havoc #t~pre15; 3355#L92 call func_to_recursive_line_22_to_23_0(~b.base, ~b.offset, ~d.base, ~d.offset, ~c.base, ~c.offset, ~a.base, ~a.offset);< 3357#$Ultimate##0 [2023-11-21 22:14:55,915 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 71610, now seen corresponding path program 8 times [2023-11-21 22:14:55,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:55,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93057416] [2023-11-21 22:14:55,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:55,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,926 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-21 22:14:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-21 22:14:55,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-21 22:14:55,934 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-21 22:14:55,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1844689622, now seen corresponding path program 5 times [2023-11-21 22:14:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-21 22:14:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482496957] [2023-11-21 22:14:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-21 22:14:55,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-21 22:14:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:00,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:02,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:04,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:15:04,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:15:05,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:15:06,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-21 22:15:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:15:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:15:06,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-21 22:15:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-21 22:15:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-21 22:15:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-21 22:15:06,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4246 backedges. 4 proven. 1740 refuted. 0 times theorem prover too weak. 2502 trivial. 0 not checked. [2023-11-21 22:15:06,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-21 22:15:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482496957] [2023-11-21 22:15:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482496957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-21 22:15:06,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531563460] [2023-11-21 22:15:06,611 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-21 22:15:06,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-21 22:15:06,611 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 [2023-11-21 22:15:06,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-21 22:15:06,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0579b6f6-c542-40b8-ae91-132ed450d239/bin/uautomizer-verify-bycVGegfSx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process