./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 01:15:13,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 01:15:13,613 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-09 01:15:13,622 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 01:15:13,623 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 01:15:13,667 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 01:15:13,668 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 01:15:13,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 01:15:13,670 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 01:15:13,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 01:15:13,672 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 01:15:13,672 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 01:15:13,673 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 01:15:13,673 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 01:15:13,674 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 01:15:13,676 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 01:15:13,677 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 01:15:13,677 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 01:15:13,677 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 01:15:13,678 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 01:15:13,678 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 01:15:13,683 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 01:15:13,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 01:15:13,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 01:15:13,684 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 01:15:13,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 01:15:13,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 01:15:13,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 01:15:13,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 01:15:13,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 01:15:13,686 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 01:15:13,686 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 01:15:13,686 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 01:15:13,687 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 01:15:13,688 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 01:15:13,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 01:15:13,689 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 01:15:13,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 01:15:13,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 01:15:13,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 01:15:13,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:15:13,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 01:15:13,692 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 01:15:13,692 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 01:15:13,693 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 01:15:13,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 01:15:13,693 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 01:15:13,694 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 01:15:13,694 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 01:15:13,694 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/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_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje 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(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> c9dfd2bf12e8d041fe6d1d6bf651e6b1ba93f167a26b0485680374a443f598c5 [2024-11-09 01:15:14,053 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 01:15:14,094 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 01:15:14,098 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 01:15:14,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 01:15:14,100 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 01:15:14,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c Unable to find full path for "g++" [2024-11-09 01:15:16,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 01:15:16,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 01:15:16,789 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/sv-benchmarks/c/recursified_loop-simple/recursified_nested_5.c [2024-11-09 01:15:16,801 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/data/e88641458/2f8f46502a1b403aa423d058572a6be7/FLAGfa2f3092b [2024-11-09 01:15:16,829 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/data/e88641458/2f8f46502a1b403aa423d058572a6be7 [2024-11-09 01:15:16,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 01:15:16,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 01:15:16,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 01:15:16,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 01:15:16,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 01:15:16,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:15:16" (1/1) ... [2024-11-09 01:15:16,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d6ba94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:16, skipping insertion in model container [2024-11-09 01:15:16,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 01:15:16" (1/1) ... [2024-11-09 01:15:16,891 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 01:15:17,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:15:17,186 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 01:15:17,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 01:15:17,255 INFO L204 MainTranslator]: Completed translation [2024-11-09 01:15:17,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17 WrapperNode [2024-11-09 01:15:17,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 01:15:17,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 01:15:17,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 01:15:17,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 01:15:17,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,315 INFO L138 Inliner]: procedures = 16, calls = 63, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-09 01:15:17,317 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 01:15:17,318 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 01:15:17,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 01:15:17,319 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 01:15:17,332 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,340 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,341 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 01:15:17,381 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 01:15:17,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 01:15:17,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 01:15:17,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (1/1) ... [2024-11-09 01:15:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 01:15:17,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:17,435 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 01:15:17,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 01:15:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 01:15:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 01:15:17,481 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 01:15:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 01:15:17,482 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_24_to_25_0 [2024-11-09 01:15:17,482 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_24_to_25_0 [2024-11-09 01:15:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_24_0 [2024-11-09 01:15:17,483 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_24_0 [2024-11-09 01:15:17,483 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_25_to_26_0 [2024-11-09 01:15:17,484 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_25_to_26_0 [2024-11-09 01:15:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 01:15:17,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 01:15:17,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 01:15:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_27_0 [2024-11-09 01:15:17,485 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_27_0 [2024-11-09 01:15:17,485 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_27_0 [2024-11-09 01:15:17,486 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_27_0 [2024-11-09 01:15:17,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 01:15:17,631 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 01:15:17,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 01:15:18,088 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-09 01:15:18,088 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 01:15:18,218 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 01:15:18,218 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 01:15:18,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:15:18 BoogieIcfgContainer [2024-11-09 01:15:18,219 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 01:15:18,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 01:15:18,223 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 01:15:18,227 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 01:15:18,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 01:15:16" (1/3) ... [2024-11-09 01:15:18,229 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a873cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:15:18, skipping insertion in model container [2024-11-09 01:15:18,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 01:15:17" (2/3) ... [2024-11-09 01:15:18,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a873cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 01:15:18, skipping insertion in model container [2024-11-09 01:15:18,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 01:15:18" (3/3) ... [2024-11-09 01:15:18,232 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_5.c [2024-11-09 01:15:18,251 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 01:15:18,251 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-09 01:15:18,332 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 01:15:18,340 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@364c42ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 01:15:18,340 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2024-11-09 01:15:18,345 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 46 states have internal predecessors, (46), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 01:15:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 01:15:18,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:18,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:18,356 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_24_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:18,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1666641975, now seen corresponding path program 1 times [2024-11-09 01:15:18,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:18,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843999395] [2024-11-09 01:15:18,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:18,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:19,414 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:19,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843999395] [2024-11-09 01:15:19,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843999395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:19,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:19,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:15:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938167142] [2024-11-09 01:15:19,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:19,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:15:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:19,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:15:19,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:15:19,468 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 46 states have internal predecessors, (46), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-09 01:15:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:19,838 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2024-11-09 01:15:19,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:15:19,843 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) Word has length 11 [2024-11-09 01:15:19,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:19,855 INFO L225 Difference]: With dead ends: 122 [2024-11-09 01:15:19,855 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:15:19,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:15:19,863 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 17 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:19,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 138 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 01:15:19,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:15:19,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2024-11-09 01:15:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 44 states have internal predecessors, (44), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-09 01:15:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2024-11-09 01:15:19,911 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 11 [2024-11-09 01:15:19,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:19,911 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2024-11-09 01:15:19,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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) [2024-11-09 01:15:19,912 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2024-11-09 01:15:19,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 01:15:19,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:19,914 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:19,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 01:15:19,914 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1209511883, now seen corresponding path program 1 times [2024-11-09 01:15:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177909587] [2024-11-09 01:15:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:20,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:20,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177909587] [2024-11-09 01:15:20,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177909587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:20,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:20,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:15:20,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186409441] [2024-11-09 01:15:20,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:20,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:15:20,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:20,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:15:20,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:15:20,245 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:15:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:20,504 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2024-11-09 01:15:20,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:15:20,504 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-09 01:15:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:20,506 INFO L225 Difference]: With dead ends: 114 [2024-11-09 01:15:20,506 INFO L226 Difference]: Without dead ends: 61 [2024-11-09 01:15:20,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:15:20,508 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:20,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 130 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:15:20,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-09 01:15:20,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2024-11-09 01:15:20,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 45 states have internal predecessors, (45), 10 states have call successors, (10), 5 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 01:15:20,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2024-11-09 01:15:20,527 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 14 [2024-11-09 01:15:20,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:20,528 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2024-11-09 01:15:20,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:15:20,528 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2024-11-09 01:15:20,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 01:15:20,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:20,529 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:20,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 01:15:20,530 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:20,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash 2093948222, now seen corresponding path program 1 times [2024-11-09 01:15:20,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:20,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348175581] [2024-11-09 01:15:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:20,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:20,808 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:20,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348175581] [2024-11-09 01:15:20,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348175581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:20,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:20,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 01:15:20,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8544619] [2024-11-09 01:15:20,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:20,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:15:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:20,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:15:20,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:15:20,811 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:20,973 INFO L93 Difference]: Finished difference Result 117 states and 142 transitions. [2024-11-09 01:15:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:15:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 01:15:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:20,976 INFO L225 Difference]: With dead ends: 117 [2024-11-09 01:15:20,976 INFO L226 Difference]: Without dead ends: 62 [2024-11-09 01:15:20,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 01:15:20,980 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:20,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:20,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-09 01:15:20,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2024-11-09 01:15:20,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.411764705882353) internal successors, (48), 47 states have internal predecessors, (48), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-09 01:15:20,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2024-11-09 01:15:20,993 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 17 [2024-11-09 01:15:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:20,993 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2024-11-09 01:15:20,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2024-11-09 01:15:20,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 01:15:20,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:20,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 01:15:20,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:20,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2101787197, now seen corresponding path program 1 times [2024-11-09 01:15:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072517149] [2024-11-09 01:15:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:20,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:21,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:21,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:21,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072517149] [2024-11-09 01:15:21,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072517149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:21,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:21,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:15:21,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322435002] [2024-11-09 01:15:21,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:21,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 01:15:21,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:21,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 01:15:21,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 01:15:21,243 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:15:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:21,446 INFO L93 Difference]: Finished difference Result 122 states and 143 transitions. [2024-11-09 01:15:21,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 01:15:21,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-09 01:15:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:21,448 INFO L225 Difference]: With dead ends: 122 [2024-11-09 01:15:21,449 INFO L226 Difference]: Without dead ends: 64 [2024-11-09 01:15:21,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:15:21,451 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 15 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:21,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 136 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 01:15:21,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-09 01:15:21,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-09 01:15:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 49 states have internal predecessors, (50), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 01:15:21,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2024-11-09 01:15:21,467 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 17 [2024-11-09 01:15:21,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:21,467 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2024-11-09 01:15:21,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 01:15:21,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2024-11-09 01:15:21,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 01:15:21,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:21,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:21,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 01:15:21,469 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:21,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:21,472 INFO L85 PathProgramCache]: Analyzing trace with hash 487885568, now seen corresponding path program 1 times [2024-11-09 01:15:21,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:21,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357833744] [2024-11-09 01:15:21,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:21,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:21,591 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357833744] [2024-11-09 01:15:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357833744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:21,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:21,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 01:15:21,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894904409] [2024-11-09 01:15:21,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:21,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 01:15:21,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:21,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 01:15:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:15:21,599 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:21,660 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2024-11-09 01:15:21,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 01:15:21,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 01:15:21,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:21,663 INFO L225 Difference]: With dead ends: 64 [2024-11-09 01:15:21,663 INFO L226 Difference]: Without dead ends: 63 [2024-11-09 01:15:21,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 01:15:21,665 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:21,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-09 01:15:21,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-09 01:15:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 48 states have internal predecessors, (49), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 01:15:21,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2024-11-09 01:15:21,683 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 18 [2024-11-09 01:15:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:21,684 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2024-11-09 01:15:21,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2024-11-09 01:15:21,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 01:15:21,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:21,687 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:21,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 01:15:21,687 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:21,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:21,688 INFO L85 PathProgramCache]: Analyzing trace with hash 438438072, now seen corresponding path program 1 times [2024-11-09 01:15:21,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:21,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229644202] [2024-11-09 01:15:21,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:21,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:22,071 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:22,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229644202] [2024-11-09 01:15:22,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229644202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 01:15:22,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 01:15:22,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 01:15:22,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629492245] [2024-11-09 01:15:22,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 01:15:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 01:15:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:22,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 01:15:22,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 01:15:22,075 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:22,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:22,264 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2024-11-09 01:15:22,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 01:15:22,265 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-09 01:15:22,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:22,267 INFO L225 Difference]: With dead ends: 67 [2024-11-09 01:15:22,268 INFO L226 Difference]: Without dead ends: 66 [2024-11-09 01:15:22,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 01:15:22,270 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 11 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:22,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 179 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 01:15:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-09 01:15:22,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2024-11-09 01:15:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.3428571428571427) internal successors, (47), 46 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (12), 8 states have call predecessors, (12), 8 states have call successors, (12) [2024-11-09 01:15:22,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2024-11-09 01:15:22,283 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 22 [2024-11-09 01:15:22,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:22,284 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2024-11-09 01:15:22,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 01:15:22,284 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2024-11-09 01:15:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 01:15:22,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:22,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:22,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 01:15:22,286 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:22,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:22,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1397037677, now seen corresponding path program 1 times [2024-11-09 01:15:22,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:22,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231558423] [2024-11-09 01:15:22,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:22,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:22,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:15:22,862 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:22,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231558423] [2024-11-09 01:15:22,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231558423] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:22,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789819998] [2024-11-09 01:15:22,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:22,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:22,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:22,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:22,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 01:15:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:23,035 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-09 01:15:23,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:23,134 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 [2024-11-09 01:15:23,466 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 01:15:23,466 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789819998] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:15:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [367348534] [2024-11-09 01:15:24,191 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:15:24,191 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:15:24,196 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:15:24,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:15:24,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 24 [2024-11-09 01:15:24,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003562705] [2024-11-09 01:15:24,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:24,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 01:15:24,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:24,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 01:15:24,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2024-11-09 01:15:24,208 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 24 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 01:15:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:24,868 INFO L93 Difference]: Finished difference Result 124 states and 148 transitions. [2024-11-09 01:15:24,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 01:15:24,869 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 27 [2024-11-09 01:15:24,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:24,870 INFO L225 Difference]: With dead ends: 124 [2024-11-09 01:15:24,870 INFO L226 Difference]: Without dead ends: 65 [2024-11-09 01:15:24,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2024-11-09 01:15:24,876 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 38 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:24,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 337 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 01:15:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-09 01:15:24,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-09 01:15:24,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 48 states have internal predecessors, (49), 10 states have call successors, (10), 6 states have call predecessors, (10), 10 states have return successors, (14), 10 states have call predecessors, (14), 8 states have call successors, (14) [2024-11-09 01:15:24,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2024-11-09 01:15:24,893 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 27 [2024-11-09 01:15:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:24,893 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2024-11-09 01:15:24,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 21 states have internal predecessors, (35), 6 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 01:15:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2024-11-09 01:15:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 01:15:24,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:24,895 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:24,918 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 01:15:25,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:25,097 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:25,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:25,097 INFO L85 PathProgramCache]: Analyzing trace with hash 769941483, now seen corresponding path program 2 times [2024-11-09 01:15:25,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:25,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756847682] [2024-11-09 01:15:25,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:25,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:26,282 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-09 01:15:26,283 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756847682] [2024-11-09 01:15:26,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756847682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:26,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003779323] [2024-11-09 01:15:26,284 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:15:26,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:26,284 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:26,286 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:26,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 01:15:26,511 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 01:15:26,511 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:15:26,516 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 01:15:26,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:26,786 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 [2024-11-09 01:15:27,426 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-09 01:15:27,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:29,759 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:29,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003779323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:15:29,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1442688895] [2024-11-09 01:15:29,763 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:15:29,764 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:15:29,764 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:15:29,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:15:29,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 21] total 48 [2024-11-09 01:15:29,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963335017] [2024-11-09 01:15:29,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:29,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-09 01:15:29,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:29,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-09 01:15:29,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 01:15:29,770 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 39 states have internal predecessors, (59), 14 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 01:15:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:31,510 INFO L93 Difference]: Finished difference Result 171 states and 208 transitions. [2024-11-09 01:15:31,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-09 01:15:31,511 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 39 states have internal predecessors, (59), 14 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 41 [2024-11-09 01:15:31,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:31,513 INFO L225 Difference]: With dead ends: 171 [2024-11-09 01:15:31,514 INFO L226 Difference]: Without dead ends: 106 [2024-11-09 01:15:31,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1361 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=561, Invalid=4409, Unknown=0, NotChecked=0, Total=4970 [2024-11-09 01:15:31,518 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 154 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:31,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 749 Invalid, 985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 875 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 01:15:31,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-09 01:15:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2024-11-09 01:15:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 71 states have internal predecessors, (78), 16 states have call successors, (16), 9 states have call predecessors, (16), 16 states have return successors, (23), 18 states have call predecessors, (23), 14 states have call successors, (23) [2024-11-09 01:15:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 117 transitions. [2024-11-09 01:15:31,536 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 117 transitions. Word has length 41 [2024-11-09 01:15:31,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:31,537 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 117 transitions. [2024-11-09 01:15:31,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 39 states have internal predecessors, (59), 14 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-09 01:15:31,538 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2024-11-09 01:15:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 01:15:31,539 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:31,539 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:31,566 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 01:15:31,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:31,744 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:31,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:31,745 INFO L85 PathProgramCache]: Analyzing trace with hash -448379287, now seen corresponding path program 3 times [2024-11-09 01:15:31,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:31,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154216159] [2024-11-09 01:15:31,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:31,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:31,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:33,512 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 16 proven. 35 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-09 01:15:33,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:33,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154216159] [2024-11-09 01:15:33,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154216159] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:33,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691869739] [2024-11-09 01:15:33,513 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 01:15:33,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:33,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:33,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 01:15:33,688 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 01:15:33,688 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:15:33,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-09 01:15:33,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:33,932 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 [2024-11-09 01:15:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-09 01:15:34,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:15:39,687 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 01:15:39,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691869739] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:15:39,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1744859081] [2024-11-09 01:15:39,691 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:15:39,691 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:15:39,692 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:15:39,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:15:39,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 31] total 60 [2024-11-09 01:15:39,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131971279] [2024-11-09 01:15:39,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:15:39,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-09 01:15:39,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:15:39,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-09 01:15:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=478, Invalid=3062, Unknown=0, NotChecked=0, Total=3540 [2024-11-09 01:15:39,699 INFO L87 Difference]: Start difference. First operand 98 states and 117 transitions. Second operand has 60 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 16 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 01:15:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:15:41,575 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2024-11-09 01:15:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 01:15:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 16 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 55 [2024-11-09 01:15:41,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:15:41,578 INFO L225 Difference]: With dead ends: 198 [2024-11-09 01:15:41,578 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 01:15:41,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=806, Invalid=5836, Unknown=0, NotChecked=0, Total=6642 [2024-11-09 01:15:41,582 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 129 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:15:41,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 813 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 01:15:41,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 01:15:41,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2024-11-09 01:15:41,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.3389830508474576) internal successors, (79), 72 states have internal predecessors, (79), 16 states have call successors, (16), 9 states have call predecessors, (16), 17 states have return successors, (24), 19 states have call predecessors, (24), 14 states have call successors, (24) [2024-11-09 01:15:41,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 119 transitions. [2024-11-09 01:15:41,604 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 119 transitions. Word has length 55 [2024-11-09 01:15:41,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:15:41,605 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 119 transitions. [2024-11-09 01:15:41,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 16 states have call successors, (19), 12 states have call predecessors, (19), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2024-11-09 01:15:41,605 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 119 transitions. [2024-11-09 01:15:41,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 01:15:41,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:15:41,610 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:15:41,630 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 01:15:41,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:41,811 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:15:41,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:15:41,812 INFO L85 PathProgramCache]: Analyzing trace with hash 466632546, now seen corresponding path program 4 times [2024-11-09 01:15:41,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:15:41,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107069038] [2024-11-09 01:15:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:15:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:15:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-09 01:15:47,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:15:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107069038] [2024-11-09 01:15:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107069038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:15:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96325896] [2024-11-09 01:15:47,801 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 01:15:47,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:15:47,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:15:47,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:15:47,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 01:15:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:15:48,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-09 01:15:48,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:15:48,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 830 treesize of output 822 [2024-11-09 01:15:48,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:15:48,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 01:15:50,411 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:15:52,417 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:15:54,457 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:15:56,462 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:15:58,548 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:00,550 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:00,680 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 94 trivial. 15 not checked. [2024-11-09 01:16:00,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96325896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:01,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1822468297] [2024-11-09 01:16:01,011 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2024-11-09 01:16:01,011 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:16:01,013 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:16:01,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:16:01,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19] total 20 [2024-11-09 01:16:01,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111656904] [2024-11-09 01:16:01,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:16:01,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 01:16:01,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:01,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 01:16:01,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=399, Unknown=15, NotChecked=126, Total=600 [2024-11-09 01:16:01,021 INFO L87 Difference]: Start difference. First operand 100 states and 119 transitions. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 01:16:03,431 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse2 (select |c_#memory_int| .cse2)))))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from false [2024-11-09 01:16:05,434 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_47| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_47| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_47|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_49| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_49| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_49|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_49| .cse2 (select |c_#memory_int| .cse2)))))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_26| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_26| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_26| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_26| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_26| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from true [2024-11-09 01:16:05,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:05,764 INFO L93 Difference]: Finished difference Result 120 states and 144 transitions. [2024-11-09 01:16:05,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 01:16:05,764 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 62 [2024-11-09 01:16:05,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:05,766 INFO L225 Difference]: With dead ends: 120 [2024-11-09 01:16:05,766 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 01:16:05,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 73 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=151, Invalid=1107, Unknown=18, NotChecked=284, Total=1560 [2024-11-09 01:16:05,772 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 73 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:05,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 445 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 436 Invalid, 0 Unknown, 239 Unchecked, 0.4s Time] [2024-11-09 01:16:05,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 01:16:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2024-11-09 01:16:05,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.289855072463768) internal successors, (89), 80 states have internal predecessors, (89), 18 states have call successors, (18), 11 states have call predecessors, (18), 17 states have return successors, (26), 21 states have call predecessors, (26), 16 states have call successors, (26) [2024-11-09 01:16:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2024-11-09 01:16:05,809 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 62 [2024-11-09 01:16:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:05,810 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2024-11-09 01:16:05,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 13 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-09 01:16:05,810 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2024-11-09 01:16:05,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-09 01:16:05,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:05,813 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 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] [2024-11-09 01:16:05,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 01:16:06,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 01:16:06,013 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:16:06,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:06,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1343272550, now seen corresponding path program 1 times [2024-11-09 01:16:06,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:06,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640776201] [2024-11-09 01:16:06,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:06,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:11,279 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-09 01:16:11,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:11,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640776201] [2024-11-09 01:16:11,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640776201] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:11,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075072398] [2024-11-09 01:16:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:11,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:11,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:11,283 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:11,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 01:16:11,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:11,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 106 conjuncts are in the unsatisfiable core [2024-11-09 01:16:11,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:11,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2024-11-09 01:16:11,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:16:13,917 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_61| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_61| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_61|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:15,919 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_61| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_61| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_61| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_61| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_61|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:17,970 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_62|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:19,972 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_62| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_62|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:22,015 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_35| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_35| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_35| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_35| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:24,017 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_35| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_35| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_35| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_35| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:26,062 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:28,064 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:30,170 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from false [2024-11-09 01:16:30,173 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from true [2024-11-09 01:16:30,512 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 93 trivial. 18 not checked. [2024-11-09 01:16:30,512 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:16:31,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075072398] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:31,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1667694418] [2024-11-09 01:16:31,059 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 01:16:31,059 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:16:31,060 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:16:31,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:16:31,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 31 [2024-11-09 01:16:31,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603017429] [2024-11-09 01:16:31,063 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:16:31,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 01:16:31,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:16:31,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 01:16:31,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=667, Unknown=15, NotChecked=280, Total=1056 [2024-11-09 01:16:31,065 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 32 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 01:16:33,627 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_61| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_61| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_61| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_61| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_61|) (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_62| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_62|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_35| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_35| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_35| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_35| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse4 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from false [2024-11-09 01:16:33,635 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_64| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_64|) (= (store |v_#memory_int_BEFORE_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_61| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_61| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_61| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_61| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_61|) (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_62| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_62| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_62| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_62| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_62|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_35| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_35| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_35| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_35| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_35| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse4 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from true [2024-11-09 01:16:35,663 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from false [2024-11-09 01:16:35,666 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_38| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_38| |c_#memory_int|))) (and (= |c_func_to_recursive_line_26_to_27_0_#in~e.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_38| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_38| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_38| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from true [2024-11-09 01:16:36,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:16:36,497 INFO L93 Difference]: Finished difference Result 232 states and 286 transitions. [2024-11-09 01:16:36,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 01:16:36,498 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) Word has length 72 [2024-11-09 01:16:36,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:16:36,500 INFO L225 Difference]: With dead ends: 232 [2024-11-09 01:16:36,500 INFO L226 Difference]: Without dead ends: 122 [2024-11-09 01:16:36,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=217, Invalid=1767, Unknown=24, NotChecked=644, Total=2652 [2024-11-09 01:16:36,502 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 76 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 40 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 395 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 01:16:36,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 414 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 633 Invalid, 2 Unknown, 395 Unchecked, 0.7s Time] [2024-11-09 01:16:36,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-09 01:16:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2024-11-09 01:16:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.273972602739726) internal successors, (93), 84 states have internal predecessors, (93), 18 states have call successors, (18), 11 states have call predecessors, (18), 21 states have return successors, (30), 25 states have call predecessors, (30), 16 states have call successors, (30) [2024-11-09 01:16:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2024-11-09 01:16:36,529 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 72 [2024-11-09 01:16:36,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:16:36,530 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2024-11-09 01:16:36,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 26 states have (on average 1.5) internal successors, (39), 23 states have internal predecessors, (39), 10 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (13), 10 states have call predecessors, (13), 7 states have call successors, (13) [2024-11-09 01:16:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2024-11-09 01:16:36,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-09 01:16:36,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:16:36,533 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:16:36,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 01:16:36,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-09 01:16:36,734 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_27_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:16:36,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:16:36,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2060591059, now seen corresponding path program 1 times [2024-11-09 01:16:36,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:16:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485562426] [2024-11-09 01:16:36,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:16:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:45,520 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 18 proven. 59 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 01:16:45,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:16:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485562426] [2024-11-09 01:16:45,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485562426] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:16:45,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820661175] [2024-11-09 01:16:45,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:16:45,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:16:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:16:45,523 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:16:45,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 01:16:45,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:16:45,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 152 conjuncts are in the unsatisfiable core [2024-11-09 01:16:45,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:16:45,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 830 treesize of output 822 [2024-11-09 01:16:45,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:16:45,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 01:16:47,985 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_79| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_79| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_79| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_79| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_79|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:49,987 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_79| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_79| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_79| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_79| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_79|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:52,022 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_80| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_80| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_80|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_80| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:54,024 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_80| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_80| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_80|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_80| .cse0 (select |c_#memory_int| .cse0))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:16:56,068 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_44| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_44| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_44| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:16:58,070 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_44| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_44| .cse0 (select |c_#memory_int| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_44| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:00,122 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_82| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_82| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_82| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_82|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_82| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:17:02,124 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_82| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_82| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_82| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_82|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_82| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:04,212 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0)))) (= (select (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0)) (not (= c_func_to_recursive_line_26_to_27_0_~e.base c_func_to_recursive_line_26_to_27_0_~d.base))) is different from false [2024-11-09 01:17:04,215 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0)))) (= (select (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0)) (not (= c_func_to_recursive_line_26_to_27_0_~e.base c_func_to_recursive_line_26_to_27_0_~d.base))) is different from true [2024-11-09 01:17:04,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 01:17:04,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 01:17:06,526 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_49| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_49| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_49| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:17:08,528 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_49| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_49| .cse0 (select |c_#memory_int| .cse0))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_49| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:10,594 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_96| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_96| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_96| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_96| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_96|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:17:12,596 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_96| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_96| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_96| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_96| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_96|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:14,629 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_52| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_52| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_52| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_52| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))))))) is different from false [2024-11-09 01:17:16,631 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_52| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_52| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_52| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_52| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))))))) is different from true [2024-11-09 01:17:18,665 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_98| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_98| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_98| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_98|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |v_#memory_int_BEFORE_CALL_98| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:17:20,667 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_98| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_98| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_98| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_98|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |v_#memory_int_BEFORE_CALL_98| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:20,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 01:17:20,783 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 19 proven. 61 refuted. 0 times theorem prover too weak. 410 trivial. 77 not checked. [2024-11-09 01:17:20,784 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:17:21,025 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_799 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base v_ArrVal_799) c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 2147483650))) is different from false [2024-11-09 01:17:21,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820661175] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:17:21,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [65035986] [2024-11-09 01:17:21,029 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 01:17:21,029 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:17:21,030 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:17:21,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:17:21,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 28] total 33 [2024-11-09 01:17:21,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072509789] [2024-11-09 01:17:21,032 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:17:21,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-09 01:17:21,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:17:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-09 01:17:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=674, Unknown=19, NotChecked=610, Total=1406 [2024-11-09 01:17:21,034 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 35 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 01:17:23,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (or (exists ((|v_#memory_int_BEFORE_CALL_82| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_82| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_82| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_82|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_82| .cse0 (select |c_#memory_int| .cse0)))))) .cse1) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_80| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_80| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_80|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_80| .cse2 (select |c_#memory_int| .cse2))) (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_98| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_98| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_98| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_98|) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |v_#memory_int_BEFORE_CALL_98| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_44| |c_#memory_int|))) (and (= .cse4 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_44| .cse4 (select |c_#memory_int| .cse4))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_44| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_79| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_79| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_79| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_79| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_79|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse5)))) .cse1) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_52| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_52| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= .cse6 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_52| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_52| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))))))) (or (exists ((|v_#memory_int_BEFORE_CALL_96| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_96| |c_#memory_int|))) (and (= .cse7 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_96| .cse7 (select |c_#memory_int| .cse7))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_96| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_96|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_49| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_49| .cse8 (select |c_#memory_int| .cse8))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse8) (= |v_old(#memory_int)_AFTER_CALL_49| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) .cse1))) is different from false [2024-11-09 01:17:25,474 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (or (exists ((|v_#memory_int_BEFORE_CALL_82| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_82| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_82| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_82|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_82| .cse0 (select |c_#memory_int| .cse0)))))) .cse1) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_80| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int_BEFORE_CALL_80| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_80| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_80|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_80| .cse2 (select |c_#memory_int| .cse2))) (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_98| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_98| |c_#memory_int|))) (and (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_98| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_98|) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |v_#memory_int_BEFORE_CALL_98| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_44| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_44| |c_#memory_int|))) (and (= .cse4 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_44| .cse4 (select |c_#memory_int| .cse4))) (= |v_old(#memory_int)_AFTER_CALL_44| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_44| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_79| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int_BEFORE_CALL_79| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_79| .cse5 (select |c_#memory_int| .cse5)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_79| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_79|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse5)))) .cse1) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_52| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_52| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_52| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|) (= .cse6 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_52| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_52| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))))))) (or (exists ((|v_#memory_int_BEFORE_CALL_96| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_96| |c_#memory_int|))) (and (= .cse7 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_96| .cse7 (select |c_#memory_int| .cse7))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_96| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_#memory_int_BEFORE_CALL_96|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_49| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_49| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_49| .cse8 (select |c_#memory_int| .cse8))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse8) (= |v_old(#memory_int)_AFTER_CALL_49| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_49| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) .cse1))) is different from true [2024-11-09 01:17:25,499 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0))) (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0)))) .cse1) (not (= c_func_to_recursive_line_26_to_27_0_~e.base c_func_to_recursive_line_26_to_27_0_~d.base)) .cse1)) is different from false [2024-11-09 01:17:25,505 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0))) (and (or (exists ((|v_old(#memory_int)_AFTER_CALL_47| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_47| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_47| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= (select (select |v_old(#memory_int)_AFTER_CALL_47| c_func_to_recursive_line_26_to_27_0_~d.base) c_func_to_recursive_line_26_to_27_0_~d.offset) 0)))) .cse1) (not (= c_func_to_recursive_line_26_to_27_0_~e.base c_func_to_recursive_line_26_to_27_0_~d.base)) .cse1)) is different from true [2024-11-09 01:17:26,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:26,076 INFO L93 Difference]: Finished difference Result 122 states and 144 transitions. [2024-11-09 01:17:26,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-09 01:17:26,078 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) Word has length 115 [2024-11-09 01:17:26,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:26,079 INFO L225 Difference]: With dead ends: 122 [2024-11-09 01:17:26,080 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 01:17:26,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 138 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 39.2s TimeCoverageRelationStatistics Valid=237, Invalid=1858, Unknown=23, NotChecked=1188, Total=3306 [2024-11-09 01:17:26,085 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 85 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 704 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:26,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 442 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 607 Invalid, 0 Unknown, 704 Unchecked, 0.6s Time] [2024-11-09 01:17:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 01:17:26,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-11-09 01:17:26,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 73 states have (on average 1.2465753424657535) internal successors, (91), 83 states have internal predecessors, (91), 18 states have call successors, (18), 11 states have call predecessors, (18), 21 states have return successors, (30), 25 states have call predecessors, (30), 16 states have call successors, (30) [2024-11-09 01:17:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 139 transitions. [2024-11-09 01:17:26,117 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 139 transitions. Word has length 115 [2024-11-09 01:17:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:26,118 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 139 transitions. [2024-11-09 01:17:26,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 17 states have internal predecessors, (40), 9 states have call successors, (11), 7 states have call predecessors, (11), 2 states have return successors, (15), 13 states have call predecessors, (15), 5 states have call successors, (15) [2024-11-09 01:17:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 139 transitions. [2024-11-09 01:17:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 01:17:26,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:26,120 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 12, 12, 12, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:17:26,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 01:17:26,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 01:17:26,325 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_26_to_27_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:17:26,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:26,325 INFO L85 PathProgramCache]: Analyzing trace with hash 546186752, now seen corresponding path program 1 times [2024-11-09 01:17:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:17:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489733373] [2024-11-09 01:17:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:26,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:32,709 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 18 proven. 60 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-09 01:17:32,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:17:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489733373] [2024-11-09 01:17:32,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489733373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:17:32,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535434153] [2024-11-09 01:17:32,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:32,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:17:32,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:17:32,712 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:17:32,716 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 01:17:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:32,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-09 01:17:32,990 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:17:33,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 542 treesize of output 534 [2024-11-09 01:17:33,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 01:17:35,369 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_64| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_64| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:17:37,371 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_64| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_64| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:39,406 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_65| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_65| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_65| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:17:41,407 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_65| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_65| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_65| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:17:41,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 01:17:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 568 backedges. 306 proven. 24 refuted. 0 times theorem prover too weak. 227 trivial. 11 not checked. [2024-11-09 01:17:41,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:17:41,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535434153] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:17:41,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [111870667] [2024-11-09 01:17:41,828 INFO L159 IcfgInterpreter]: Started Sifa with 26 locations of interest [2024-11-09 01:17:41,828 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:17:41,829 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:17:41,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:17:41,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 28 [2024-11-09 01:17:41,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201193070] [2024-11-09 01:17:41,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:17:41,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 01:17:41,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:17:41,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 01:17:41,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=764, Unknown=15, NotChecked=114, Total=992 [2024-11-09 01:17:41,832 INFO L87 Difference]: Start difference. First operand 119 states and 139 transitions. Second operand has 29 states, 24 states have (on average 1.875) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (14), 8 states have call predecessors, (14), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 01:17:44,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_64| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_64| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_65| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_65| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_65| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_65| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1))) is different from false [2024-11-09 01:17:46,175 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_64| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_64| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_64| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_64| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_64| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|)))) .cse1) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_old(#memory_int)_AFTER_CALL_65| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_65| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_65| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_65| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= (store |v_old(#memory_int)_AFTER_CALL_65| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|)))) .cse1))) is different from true [2024-11-09 01:17:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:17:46,720 INFO L93 Difference]: Finished difference Result 149 states and 186 transitions. [2024-11-09 01:17:46,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-09 01:17:46,721 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 24 states have (on average 1.875) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (14), 8 states have call predecessors, (14), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) Word has length 116 [2024-11-09 01:17:46,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:17:46,723 INFO L225 Difference]: With dead ends: 149 [2024-11-09 01:17:46,723 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 01:17:46,725 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 152 SyntacticMatches, 6 SemanticMatches, 58 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=390, Invalid=2797, Unknown=17, NotChecked=336, Total=3540 [2024-11-09 01:17:46,726 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 134 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 201 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 01:17:46,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 366 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 448 Invalid, 0 Unknown, 201 Unchecked, 0.3s Time] [2024-11-09 01:17:46,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 01:17:46,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2024-11-09 01:17:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 94 states have internal predecessors, (99), 24 states have call successors, (24), 13 states have call predecessors, (24), 21 states have return successors, (42), 27 states have call predecessors, (42), 22 states have call successors, (42) [2024-11-09 01:17:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 165 transitions. [2024-11-09 01:17:46,750 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 165 transitions. Word has length 116 [2024-11-09 01:17:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:17:46,750 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 165 transitions. [2024-11-09 01:17:46,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 24 states have (on average 1.875) internal successors, (45), 19 states have internal predecessors, (45), 12 states have call successors, (14), 8 states have call predecessors, (14), 3 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2024-11-09 01:17:46,751 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 165 transitions. [2024-11-09 01:17:46,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-09 01:17:46,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:17:46,754 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 18, 18, 18, 18, 18, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:17:46,778 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 01:17:46,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-09 01:17:46,958 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:17:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:17:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2016799250, now seen corresponding path program 2 times [2024-11-09 01:17:46,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:17:46,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084930999] [2024-11-09 01:17:46,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:17:46,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:17:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:17:57,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 57 proven. 131 refuted. 0 times theorem prover too weak. 1150 trivial. 0 not checked. [2024-11-09 01:17:57,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:17:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084930999] [2024-11-09 01:17:57,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084930999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:17:57,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701487095] [2024-11-09 01:17:57,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 01:17:57,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:17:57,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:17:57,144 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:17:57,146 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 01:17:58,902 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2024-11-09 01:17:58,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:17:58,913 WARN L253 TraceCheckSpWp]: Trace formula consists of 800 conjuncts, 403 conjuncts are in the unsatisfiable core [2024-11-09 01:17:58,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:17:58,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1094 treesize of output 1078 [2024-11-09 01:17:59,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:18:00,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 17 [2024-11-09 01:18:08,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2024-11-09 01:18:44,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1338 backedges. 304 proven. 549 refuted. 0 times theorem prover too weak. 485 trivial. 0 not checked. [2024-11-09 01:18:44,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:19:08,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:08,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 197 [2024-11-09 01:19:08,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 01:19:08,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 199 treesize of output 183 [2024-11-09 01:19:11,644 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_func_to_recursive_line_27_to_27_0_~e.offset_374 Int) (v_func_to_recursive_line_27_to_27_0_~e.offset_373 Int)) (let ((.cse1 (select (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~d.base (let ((.cse3 (select (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~e.base v_arrayElimArr_3) c_func_to_recursive_line_25_to_26_0_~d.base))) (store .cse3 c_func_to_recursive_line_25_to_26_0_~d.offset (+ (select .cse3 c_func_to_recursive_line_25_to_26_0_~d.offset) 1)))) c_func_to_recursive_line_25_to_26_0_~e.base v_arrayElimArr_4) c_func_to_recursive_line_25_to_26_0_~d.base))) (let ((.cse2 (select .cse1 c_func_to_recursive_line_25_to_26_0_~d.offset))) (or (not (= 6 (select v_arrayElimArr_3 v_func_to_recursive_line_27_to_27_0_~e.offset_373))) (< (select (select (let ((.cse0 (store .cse1 c_func_to_recursive_line_25_to_26_0_~d.offset (+ .cse2 1)))) (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~d.base .cse0) c_func_to_recursive_line_25_to_26_0_~e.base (store (select (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~e.base v_arrayElimArr_4) c_func_to_recursive_line_25_to_26_0_~d.base .cse0) c_func_to_recursive_line_25_to_26_0_~e.base) c_func_to_recursive_line_25_to_26_0_~e.offset 6))) c_func_to_recursive_line_25_to_26_0_~d.base) c_func_to_recursive_line_25_to_26_0_~d.offset) 5) (not (= 6 (select v_arrayElimArr_4 v_func_to_recursive_line_27_to_27_0_~e.offset_374))) (< 4 .cse2))))) is different from false [2024-11-09 01:19:11,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701487095] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:19:11,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [171346184] [2024-11-09 01:19:11,812 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 01:19:11,812 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:19:11,813 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:19:11,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:19:11,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 51] total 73 [2024-11-09 01:19:11,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088677344] [2024-11-09 01:19:11,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:19:11,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2024-11-09 01:19:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:19:11,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2024-11-09 01:19:11,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=5068, Unknown=10, NotChecked=144, Total=5550 [2024-11-09 01:19:11,820 INFO L87 Difference]: Start difference. First operand 134 states and 165 transitions. Second operand has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 64 states have internal predecessors, (85), 21 states have call successors, (21), 7 states have call predecessors, (21), 21 states have return successors, (27), 23 states have call predecessors, (27), 15 states have call successors, (27) [2024-11-09 01:19:26,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:19:32,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:19:49,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:19:57,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:04,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:06,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:09,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:13,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:16,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:19,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:22,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:32,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:35,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:37,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:40,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:42,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:51,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:53,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:20:59,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:01,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:04,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:16,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:20,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:23,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:36,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:39,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:42,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:21:55,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:21:55,159 INFO L93 Difference]: Finished difference Result 365 states and 523 transitions. [2024-11-09 01:21:55,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-11-09 01:21:55,160 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 64 states have internal predecessors, (85), 21 states have call successors, (21), 7 states have call predecessors, (21), 21 states have return successors, (27), 23 states have call predecessors, (27), 15 states have call successors, (27) Word has length 182 [2024-11-09 01:21:55,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:21:55,163 INFO L225 Difference]: With dead ends: 365 [2024-11-09 01:21:55,164 INFO L226 Difference]: Without dead ends: 233 [2024-11-09 01:21:55,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 218 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4386 ImplicationChecksByTransitivity, 105.5s TimeCoverageRelationStatistics Valid=656, Invalid=11979, Unknown=25, NotChecked=222, Total=12882 [2024-11-09 01:21:55,169 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 182 mSDsluCounter, 1192 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 94 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 90.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 2199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 101.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:21:55,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1233 Invalid, 2199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 2074 Invalid, 31 Unknown, 0 Unchecked, 101.1s Time] [2024-11-09 01:21:55,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-09 01:21:55,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 152. [2024-11-09 01:21:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 94 states have (on average 1.1702127659574468) internal successors, (110), 105 states have internal predecessors, (110), 26 states have call successors, (26), 13 states have call predecessors, (26), 26 states have return successors, (65), 34 states have call predecessors, (65), 24 states have call successors, (65) [2024-11-09 01:21:55,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 201 transitions. [2024-11-09 01:21:55,214 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 201 transitions. Word has length 182 [2024-11-09 01:21:55,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:21:55,215 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 201 transitions. [2024-11-09 01:21:55,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 58 states have (on average 1.4655172413793103) internal successors, (85), 64 states have internal predecessors, (85), 21 states have call successors, (21), 7 states have call predecessors, (21), 21 states have return successors, (27), 23 states have call predecessors, (27), 15 states have call successors, (27) [2024-11-09 01:21:55,216 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 201 transitions. [2024-11-09 01:21:55,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-09 01:21:55,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:21:55,221 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 27, 27, 27, 27, 27, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:21:55,249 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 01:21:55,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:21:55,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:21:55,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:21:55,422 INFO L85 PathProgramCache]: Analyzing trace with hash 491205104, now seen corresponding path program 3 times [2024-11-09 01:21:55,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:21:55,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511794165] [2024-11-09 01:21:55,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:21:55,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:21:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:22:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2983 backedges. 404 proven. 796 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2024-11-09 01:22:04,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:22:04,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511794165] [2024-11-09 01:22:04,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511794165] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:22:04,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985538227] [2024-11-09 01:22:04,687 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 01:22:04,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:22:04,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:22:04,688 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:22:04,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 01:22:05,105 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 01:22:05,105 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 01:22:05,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 140 conjuncts are in the unsatisfiable core [2024-11-09 01:22:05,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:22:09,298 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 [2024-11-09 01:22:15,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2983 backedges. 1913 proven. 38 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2024-11-09 01:22:15,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:23:56,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2983 backedges. 395 proven. 871 refuted. 0 times theorem prover too weak. 1717 trivial. 0 not checked. [2024-11-09 01:23:56,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985538227] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 01:23:56,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [61212583] [2024-11-09 01:23:56,424 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 01:23:56,425 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:23:56,425 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:23:56,425 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 01:23:56,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 36] total 59 [2024-11-09 01:23:56,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59361931] [2024-11-09 01:23:56,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 01:23:56,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-09 01:23:56,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:23:56,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-09 01:23:56,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=375, Invalid=3047, Unknown=0, NotChecked=0, Total=3422 [2024-11-09 01:23:56,429 INFO L87 Difference]: Start difference. First operand 152 states and 201 transitions. Second operand has 59 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 48 states have internal predecessors, (102), 21 states have call successors, (31), 13 states have call predecessors, (31), 10 states have return successors, (35), 11 states have call predecessors, (35), 18 states have call successors, (35) [2024-11-09 01:24:27,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:24:27,058 INFO L93 Difference]: Finished difference Result 309 states and 426 transitions. [2024-11-09 01:24:27,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-09 01:24:27,059 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 48 states have internal predecessors, (102), 21 states have call successors, (31), 13 states have call predecessors, (31), 10 states have return successors, (35), 11 states have call predecessors, (35), 18 states have call successors, (35) Word has length 258 [2024-11-09 01:24:27,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:24:27,061 INFO L225 Difference]: With dead ends: 309 [2024-11-09 01:24:27,061 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 01:24:27,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 584 GetRequests, 493 SyntacticMatches, 7 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 50.9s TimeCoverageRelationStatistics Valid=928, Invalid=6382, Unknown=0, NotChecked=0, Total=7310 [2024-11-09 01:24:27,065 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 186 mSDsluCounter, 743 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2024-11-09 01:24:27,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 778 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 17.0s Time] [2024-11-09 01:24:27,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 01:24:27,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2024-11-09 01:24:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 101 states have internal predecessors, (105), 25 states have call successors, (25), 13 states have call predecessors, (25), 25 states have return successors, (45), 31 states have call predecessors, (45), 23 states have call successors, (45) [2024-11-09 01:24:27,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 175 transitions. [2024-11-09 01:24:27,090 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 175 transitions. Word has length 258 [2024-11-09 01:24:27,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:24:27,091 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 175 transitions. [2024-11-09 01:24:27,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 48 states have internal predecessors, (102), 21 states have call successors, (31), 13 states have call predecessors, (31), 10 states have return successors, (35), 11 states have call predecessors, (35), 18 states have call successors, (35) [2024-11-09 01:24:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 175 transitions. [2024-11-09 01:24:27,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-09 01:24:27,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:24:27,096 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 30, 30, 30, 30, 30, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:24:27,118 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-09 01:24:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 01:24:27,297 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:24:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:24:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1858410122, now seen corresponding path program 4 times [2024-11-09 01:24:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:24:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568935059] [2024-11-09 01:24:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:24:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:24:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:05,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 194 proven. 321 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2024-11-09 01:25:05,044 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 01:25:05,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568935059] [2024-11-09 01:25:05,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568935059] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:25:05,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878801410] [2024-11-09 01:25:05,045 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 01:25:05,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 01:25:05,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 01:25:05,046 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 01:25:05,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 01:25:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 01:25:05,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 1176 conjuncts, 357 conjuncts are in the unsatisfiable core [2024-11-09 01:25:05,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 01:25:05,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16054 treesize of output 15798 [2024-11-09 01:25:05,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 01:25:12,107 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_196| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_196| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_196| .cse0 (select |c_#memory_int| .cse0))) (= |v_#memory_int_BEFORE_CALL_196| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_196| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:25:14,109 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_196| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_196| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_196| .cse0 (select |c_#memory_int| .cse0))) (= |v_#memory_int_BEFORE_CALL_196| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_196| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:25:16,573 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_197| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_197| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_197| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |v_#memory_int_BEFORE_CALL_197| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_197| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:25:18,575 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_197| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_197| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_197| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= |v_#memory_int_BEFORE_CALL_197| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_197| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:25:21,478 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_139| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_139| |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_139| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_139| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_139|)))))) is different from false [2024-11-09 01:25:23,480 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_139| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_139| |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0) (= (store |v_old(#memory_int)_AFTER_CALL_139| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_139| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_139|)))))) is different from true [2024-11-09 01:25:29,983 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_210| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_210| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_210| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_210| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_210| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:25:31,985 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_210| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_210| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_210| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_210| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_210| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:25:35,281 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_145| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_145| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_145| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_145| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_145|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:25:37,283 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_145| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_145| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_145| .cse0 (select |c_#memory_int| .cse0))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_145| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_145|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:25:39,794 WARN L851 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_146| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_146| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_146| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_146| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_146|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0)))))) is different from false [2024-11-09 01:25:41,796 WARN L873 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_146| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_146| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_146| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_146| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_146|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse0)))))) is different from true [2024-11-09 01:25:48,044 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_150| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_150| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_150|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:25:50,046 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_150| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_150| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_150|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:25:52,778 WARN L851 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_152| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_152| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_152| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_152|) (= (store |v_old(#memory_int)_AFTER_CALL_152| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from false [2024-11-09 01:25:54,780 WARN L873 $PredicateComparison]: unable to prove that (or (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|) (exists ((|v_old(#memory_int)_AFTER_CALL_152| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_152| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse0) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_152| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_152|) (= (store |v_old(#memory_int)_AFTER_CALL_152| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|))))) is different from true [2024-11-09 01:26:01,311 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_157| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_157| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_157| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_157| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_157|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:26:03,313 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_old(#memory_int)_AFTER_CALL_157| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_157| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_157| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_157| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_157|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:26:10,737 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_257| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_257| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_257| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_257| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_257| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from false [2024-11-09 01:26:12,742 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_#memory_int_BEFORE_CALL_257| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_257| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_257| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_257| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_257| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|)) is different from true [2024-11-09 01:26:15,566 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_167| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_167| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_167| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_167| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_167| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from false [2024-11-09 01:26:17,567 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_167| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_167| |c_#memory_int|))) (and (= .cse0 |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_167| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_167| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_167| .cse0 (select |c_#memory_int| .cse0)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|))) is different from true [2024-11-09 01:26:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 211 proven. 371 refuted. 0 times theorem prover too weak. 2960 trivial. 253 not checked. [2024-11-09 01:26:32,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 01:27:01,049 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2184 Int) (v_ArrVal_2183 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2176 (Array Int Int)) (v_ArrVal_2180 Int) (v_ArrVal_2185 (Array Int Int)) (v_ArrVal_2181 Int)) (let ((.cse1 (select (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~e.base v_ArrVal_2185) c_func_to_recursive_line_25_to_26_0_~d.base))) (let ((.cse3 (select (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~d.base (store .cse1 c_func_to_recursive_line_25_to_26_0_~d.offset v_ArrVal_2181)) c_func_to_recursive_line_25_to_26_0_~e.base v_ArrVal_2178) c_func_to_recursive_line_25_to_26_0_~d.base))) (let ((.cse2 (select (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~d.base (store .cse3 c_func_to_recursive_line_25_to_26_0_~d.offset v_ArrVal_2180)) c_func_to_recursive_line_25_to_26_0_~e.base v_ArrVal_2177) c_func_to_recursive_line_25_to_26_0_~d.base))) (let ((.cse0 (select (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~d.base (store .cse2 c_func_to_recursive_line_25_to_26_0_~d.offset v_ArrVal_2183)) c_func_to_recursive_line_25_to_26_0_~e.base v_ArrVal_2179) c_func_to_recursive_line_25_to_26_0_~d.base))) (or (< (+ (select .cse0 c_func_to_recursive_line_25_to_26_0_~d.offset) 1) v_ArrVal_2184) (< (+ (select .cse1 c_func_to_recursive_line_25_to_26_0_~d.offset) 1) v_ArrVal_2181) (< (select (select (store (store |c_#memory_int| c_func_to_recursive_line_25_to_26_0_~d.base (store .cse0 c_func_to_recursive_line_25_to_26_0_~d.offset v_ArrVal_2184)) c_func_to_recursive_line_25_to_26_0_~e.base v_ArrVal_2176) c_func_to_recursive_line_25_to_26_0_~d.base) c_func_to_recursive_line_25_to_26_0_~d.offset) 5) (< (+ (select .cse2 c_func_to_recursive_line_25_to_26_0_~d.offset) 1) v_ArrVal_2183) (< (+ (select .cse3 c_func_to_recursive_line_25_to_26_0_~d.offset) 1) v_ArrVal_2180))))))) is different from false [2024-11-09 01:27:01,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878801410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 01:27:01,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [75530548] [2024-11-09 01:27:01,067 INFO L159 IcfgInterpreter]: Started Sifa with 30 locations of interest [2024-11-09 01:27:01,067 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 01:27:01,067 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 01:27:01,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 01:27:01,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 37] total 52 [2024-11-09 01:27:01,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9514902] [2024-11-09 01:27:01,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 01:27:01,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-09 01:27:01,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 01:27:01,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-09 01:27:01,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1531, Unknown=37, NotChecked=1092, Total=2862 [2024-11-09 01:27:01,072 INFO L87 Difference]: Start difference. First operand 145 states and 175 transitions. Second operand has 53 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 37 states have internal predecessors, (62), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (29), 26 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-09 01:27:12,202 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_150| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_150| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_150|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_157| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_157| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_157| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_157| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_157|) (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_257| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_257| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_257| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_257| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_257| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_210| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_210| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_210| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_210| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_210| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse4 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_145| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int)_AFTER_CALL_145| |c_#memory_int|))) (and (= .cse5 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_145| .cse5 (select |c_#memory_int| .cse5))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_145| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_145|)))) .cse1) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_152| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_152| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse6) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_152| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_152|) (= (store |v_old(#memory_int)_AFTER_CALL_152| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|))))) (or (exists ((|v_#memory_int_BEFORE_CALL_197| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_197| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_197| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse7) (= |v_#memory_int_BEFORE_CALL_197| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_197| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_196| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int_BEFORE_CALL_196| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_196| .cse8 (select |c_#memory_int| .cse8))) (= |v_#memory_int_BEFORE_CALL_196| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_196| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse8 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from false [2024-11-09 01:27:14,206 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |c_#memory_int|))) (and (= (store |c_old(#memory_int)| c_func_to_recursive_line_27_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_27_to_27_0_~e.base)) |c_#memory_int|) (or (exists ((|v_old(#memory_int)_AFTER_CALL_150| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_150| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_150| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= .cse0 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_150| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_150|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_157| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_157| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_157| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_157| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_157|) (= .cse2 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_257| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_int_BEFORE_CALL_257| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_257| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_257| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_257| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse3 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| c_func_to_recursive_line_27_to_27_0_~e.base) (or (exists ((|v_#memory_int_BEFORE_CALL_210| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int_BEFORE_CALL_210| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_210| .cse4 (select |c_#memory_int| .cse4)) |c_#memory_int|) (= |v_#memory_int_BEFORE_CALL_210| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_210| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse4 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1) (or (exists ((|v_old(#memory_int)_AFTER_CALL_145| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_old(#memory_int)_AFTER_CALL_145| |c_#memory_int|))) (and (= .cse5 |c_func_to_recursive_line_27_to_27_0_#in~e.base|) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_145| .cse5 (select |c_#memory_int| .cse5))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_145| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_145|)))) .cse1) (or .cse1 (exists ((|v_old(#memory_int)_AFTER_CALL_152| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_old(#memory_int)_AFTER_CALL_152| |c_#memory_int|))) (and (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse6) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_152| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)) |v_old(#memory_int)_AFTER_CALL_152|) (= (store |v_old(#memory_int)_AFTER_CALL_152| .cse6 (select |c_#memory_int| .cse6)) |c_#memory_int|))))) (or (exists ((|v_#memory_int_BEFORE_CALL_197| (Array Int (Array Int Int)))) (let ((.cse7 (@diff |v_#memory_int_BEFORE_CALL_197| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_197| .cse7 (select |c_#memory_int| .cse7)) |c_#memory_int|) (= |c_func_to_recursive_line_27_to_27_0_#in~e.base| .cse7) (= |v_#memory_int_BEFORE_CALL_197| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_197| |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))))) .cse1) (or (exists ((|v_#memory_int_BEFORE_CALL_196| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int_BEFORE_CALL_196| |c_#memory_int|))) (and (= |c_#memory_int| (store |v_#memory_int_BEFORE_CALL_196| .cse8 (select |c_#memory_int| .cse8))) (= |v_#memory_int_BEFORE_CALL_196| (store |c_old(#memory_int)| |c_func_to_recursive_line_27_to_27_0_#in~e.base| (select |v_#memory_int_BEFORE_CALL_196| |c_func_to_recursive_line_27_to_27_0_#in~e.base|))) (= .cse8 |c_func_to_recursive_line_27_to_27_0_#in~e.base|)))) .cse1))) is different from true [2024-11-09 01:27:16,496 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) .cse0 (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_146| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_146| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_146| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_146| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_146|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse1))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_167| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_167| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_167| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_167| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_167| .cse2 (select |c_#memory_int| .cse2)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|)) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_139| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_139| |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base .cse3) (= (store |v_old(#memory_int)_AFTER_CALL_139| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_139| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_139|))))))) is different from false [2024-11-09 01:27:16,519 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |c_#memory_int| c_func_to_recursive_line_26_to_27_0_~e.base)) |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base |c_func_to_recursive_line_26_to_27_0_#in~e.base|) .cse0 (= |c_func_to_recursive_line_26_to_27_0_#in~d.base| c_func_to_recursive_line_26_to_27_0_~d.base) (= c_func_to_recursive_line_26_to_27_0_~d.offset |c_func_to_recursive_line_26_to_27_0_#in~d.offset|) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_146| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_146| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_146| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_146| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_146|) (= c_func_to_recursive_line_26_to_27_0_~e.base .cse1))))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_167| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_167| |c_#memory_int|))) (and (= .cse2 |c_func_to_recursive_line_26_to_27_0_#in~e.base|) (= |v_old(#memory_int)_AFTER_CALL_167| (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |v_old(#memory_int)_AFTER_CALL_167| |c_func_to_recursive_line_26_to_27_0_#in~e.base|))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_167| .cse2 (select |c_#memory_int| .cse2)))))) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_26_to_27_0_#in~e.base| (select |c_#memory_int| |c_func_to_recursive_line_26_to_27_0_#in~e.base|)) |c_#memory_int|)) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_139| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_139| |c_#memory_int|))) (and (= c_func_to_recursive_line_26_to_27_0_~e.base .cse3) (= (store |v_old(#memory_int)_AFTER_CALL_139| .cse3 (select |c_#memory_int| .cse3)) |c_#memory_int|) (= (store |c_old(#memory_int)| c_func_to_recursive_line_26_to_27_0_~e.base (select |v_old(#memory_int)_AFTER_CALL_139| c_func_to_recursive_line_26_to_27_0_~e.base)) |v_old(#memory_int)_AFTER_CALL_139|))))))) is different from true [2024-11-09 01:27:20,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:21,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:25,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:28,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:30,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:33,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:34,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:42,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 01:27:58,060 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 203 DAG size of output: 180 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-09 01:28:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 01:28:10,042 INFO L93 Difference]: Finished difference Result 294 states and 368 transitions. [2024-11-09 01:28:10,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-09 01:28:10,043 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 37 states have internal predecessors, (62), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (29), 26 states have call predecessors, (29), 10 states have call successors, (29) Word has length 292 [2024-11-09 01:28:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 01:28:10,045 INFO L225 Difference]: With dead ends: 294 [2024-11-09 01:28:10,045 INFO L226 Difference]: Without dead ends: 151 [2024-11-09 01:28:10,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 380 SyntacticMatches, 35 SemanticMatches, 72 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 111.2s TimeCoverageRelationStatistics Valid=357, Invalid=3172, Unknown=67, NotChecked=1806, Total=5402 [2024-11-09 01:28:10,048 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 69 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 31 mSolverCounterUnsat, 27 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 1815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 27 IncrementalHoareTripleChecker+Unknown, 882 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2024-11-09 01:28:10,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 615 Invalid, 1815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 875 Invalid, 27 Unknown, 882 Unchecked, 34.1s Time] [2024-11-09 01:28:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-09 01:28:10,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2024-11-09 01:28:10,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 91 states have (on average 1.1758241758241759) internal successors, (107), 103 states have internal predecessors, (107), 25 states have call successors, (25), 13 states have call predecessors, (25), 27 states have return successors, (47), 33 states have call predecessors, (47), 23 states have call successors, (47) [2024-11-09 01:28:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 179 transitions. [2024-11-09 01:28:10,088 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 179 transitions. Word has length 292 [2024-11-09 01:28:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 01:28:10,089 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 179 transitions. [2024-11-09 01:28:10,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 37 states have internal predecessors, (62), 13 states have call successors, (13), 4 states have call predecessors, (13), 13 states have return successors, (29), 26 states have call predecessors, (29), 10 states have call successors, (29) [2024-11-09 01:28:10,089 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 179 transitions. [2024-11-09 01:28:10,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-09 01:28:10,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 01:28:10,091 INFO L215 NwaCegarLoop]: trace histogram [42, 42, 36, 36, 36, 36, 36, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 01:28:10,116 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 01:28:10,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e8390a36-d2e5-4e43-925b-16d2f1a30706/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 01:28:10,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting func_to_recursive_line_25_to_26_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_24_to_25_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_24_to_25_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-09 01:28:10,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 01:28:10,296 INFO L85 PathProgramCache]: Analyzing trace with hash 452831509, now seen corresponding path program 5 times [2024-11-09 01:28:10,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 01:28:10,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070950085] [2024-11-09 01:28:10,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 01:28:10,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 01:28:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat