./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 30e01a73 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_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire --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 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:32:32,557 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:32:32,654 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Overflow-32bit-Taipan_Default.epf [2023-11-23 20:32:32,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:32:32,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:32:32,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:32:32,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:32:32,710 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:32:32,711 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:32:32,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:32:32,712 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:32:32,713 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:32:32,714 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:32:32,714 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:32:32,715 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:32:32,716 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:32:32,716 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:32:32,717 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:32:32,718 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:32:32,718 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:32:32,719 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:32:32,720 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:32:32,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:32:32,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 20:32:32,722 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:32:32,722 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:32:32,723 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:32:32,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:32:32,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 20:32:32,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:32:32,726 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 20:32:32,727 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-23 20:32:32,727 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:32:32,727 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:32:32,728 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 20:32:32,728 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:32:32,729 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:32:32,729 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:32:32,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:32:32,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:32:32,730 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:32:32,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:32:32,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 20:32:32,731 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:32:32,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:32:32,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:32:32,733 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 20:32:32,733 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:32:32,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:32:32,733 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_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/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_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire 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 -> 9a8e2b8a66923dd7d46d9db92fbd8b38c75eb8108da5237ec87b15cd1ae67985 [2023-11-23 20:32:33,064 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:32:33,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:32:33,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:32:33,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:32:33,107 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:32:33,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-23 20:32:36,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:32:36,603 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:32:36,603 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/sv-benchmarks/c/recursified_loop-simple/recursified_nested_3.c [2023-11-23 20:32:36,614 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/data/45b473749/ebaf59cb377f46e595012a66d9b2bcac/FLAGaf1853b35 [2023-11-23 20:32:36,631 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/data/45b473749/ebaf59cb377f46e595012a66d9b2bcac [2023-11-23 20:32:36,634 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:32:36,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:32:36,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:32:36,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:32:36,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:32:36,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,647 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5e29f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36, skipping insertion in model container [2023-11-23 20:32:36,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,674 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:32:36,854 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:32:36,866 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:32:36,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:32:36,902 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:32:36,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36 WrapperNode [2023-11-23 20:32:36,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:32:36,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:32:36,904 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:32:36,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:32:36,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,924 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,947 INFO L138 Inliner]: procedures = 14, calls = 41, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 53 [2023-11-23 20:32:36,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:32:36,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:32:36,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:32:36,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:32:36,960 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,971 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,974 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,988 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:36,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:32:36,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:32:36,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:32:36,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:32:36,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (1/1) ... [2023-11-23 20:32:37,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:32:37,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:37,039 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:32:37,060 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:32:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:32:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:32:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:32:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:32:37,081 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_23_to_23_0 [2023-11-23 20:32:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_23_to_23_0 [2023-11-23 20:32:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_22_to_23_0 [2023-11-23 20:32:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_22_to_23_0 [2023-11-23 20:32:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:32:37,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:32:37,082 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:32:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_21_to_22_0 [2023-11-23 20:32:37,083 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_21_to_22_0 [2023-11-23 20:32:37,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:32:37,165 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:32:37,167 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:32:37,436 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:32:37,521 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:32:37,521 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:32:37,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:37 BoogieIcfgContainer [2023-11-23 20:32:37,523 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:32:37,526 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:32:37,526 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:32:37,530 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:32:37,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:32:36" (1/3) ... [2023-11-23 20:32:37,531 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea2dffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:32:37, skipping insertion in model container [2023-11-23 20:32:37,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:32:36" (2/3) ... [2023-11-23 20:32:37,532 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea2dffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:32:37, skipping insertion in model container [2023-11-23 20:32:37,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:32:37" (3/3) ... [2023-11-23 20:32:37,534 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_nested_3.c [2023-11-23 20:32:37,554 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:32:37,554 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-23 20:32:37,611 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:32:37,620 INFO L357 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, mHoare=true, 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;@e3f0f3d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:32:37,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-23 20:32:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-23 20:32:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:32:37,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:37,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:37,639 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:37,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:37,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1687961075, now seen corresponding path program 1 times [2023-11-23 20:32:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:37,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337410598] [2023-11-23 20:32:37,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:38,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:38,444 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:38,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337410598] [2023-11-23 20:32:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337410598] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:32:38,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:32:38,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:32:38,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103513416] [2023-11-23 20:32:38,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:38,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:32:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:38,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:32:38,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:32:38,492 INFO L87 Difference]: Start difference. First operand has 35 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 28 states have internal predecessors, (28), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:32:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:38,662 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2023-11-23 20:32:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:32:38,665 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-23 20:32:38,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:38,706 INFO L225 Difference]: With dead ends: 48 [2023-11-23 20:32:38,706 INFO L226 Difference]: Without dead ends: 42 [2023-11-23 20:32:38,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:32:38,713 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:38,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 133 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:32:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-11-23 20:32:38,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2023-11-23 20:32:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2023-11-23 20:32:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-11-23 20:32:38,797 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 11 [2023-11-23 20:32:38,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:38,797 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-11-23 20:32:38,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:32:38,798 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-11-23 20:32:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-23 20:32:38,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:38,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:38,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:32:38,801 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:38,802 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1680998632, now seen corresponding path program 1 times [2023-11-23 20:32:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957928560] [2023-11-23 20:32:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:39,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957928560] [2023-11-23 20:32:39,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957928560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:32:39,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:32:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:32:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967239656] [2023-11-23 20:32:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:39,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:32:39,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:39,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:32:39,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:32:39,085 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. 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) [2023-11-23 20:32:39,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:39,201 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2023-11-23 20:32:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:32:39,202 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 [2023-11-23 20:32:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:39,206 INFO L225 Difference]: With dead ends: 76 [2023-11-23 20:32:39,207 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 20:32:39,213 INFO L412 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 [2023-11-23 20:32:39,216 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:39,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:32:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 20:32:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-23 20:32:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 32 states have internal predecessors, (33), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 20:32:39,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2023-11-23 20:32:39,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 11 [2023-11-23 20:32:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:39,243 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2023-11-23 20:32:39,243 INFO L496 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) [2023-11-23 20:32:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2023-11-23 20:32:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 20:32:39,245 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:39,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:39,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:32:39,247 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:39,249 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:39,249 INFO L85 PathProgramCache]: Analyzing trace with hash -564507169, now seen corresponding path program 1 times [2023-11-23 20:32:39,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:39,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385041570] [2023-11-23 20:32:39,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:39,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:39,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:39,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:39,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385041570] [2023-11-23 20:32:39,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385041570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:32:39,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:32:39,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:32:39,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632826027] [2023-11-23 20:32:39,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:39,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:32:39,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:39,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:32:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:32:39,497 INFO L87 Difference]: Start difference. First operand 41 states and 46 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) [2023-11-23 20:32:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:39,605 INFO L93 Difference]: Finished difference Result 80 states and 92 transitions. [2023-11-23 20:32:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:32:39,607 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 [2023-11-23 20:32:39,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:39,608 INFO L225 Difference]: With dead ends: 80 [2023-11-23 20:32:39,608 INFO L226 Difference]: Without dead ends: 39 [2023-11-23 20:32:39,609 INFO L412 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 [2023-11-23 20:32:39,610 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:39,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:32:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-23 20:32:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-23 20:32:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:32:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-23 20:32:39,622 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 14 [2023-11-23 20:32:39,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:39,623 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-23 20:32:39,623 INFO L496 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) [2023-11-23 20:32:39,627 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-23 20:32:39,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:32:39,629 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:39,629 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:39,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:32:39,629 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:39,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash 789392049, now seen corresponding path program 1 times [2023-11-23 20:32:39,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:39,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975183720] [2023-11-23 20:32:39,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:39,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:40,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:40,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975183720] [2023-11-23 20:32:40,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975183720] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:40,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238167511] [2023-11-23 20:32:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:40,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:40,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:40,070 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:40,091 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 20:32:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:40,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 20:32:40,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:40,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:32:40,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2023-11-23 20:32:40,355 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 [2023-11-23 20:32:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:40,374 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:32:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:40,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238167511] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:40,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:32:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9, 8] total 17 [2023-11-23 20:32:40,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971790239] [2023-11-23 20:32:40,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:40,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:32:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:32:40,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2023-11-23 20:32:40,460 INFO L87 Difference]: Start difference. First operand 39 states and 43 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:32:40,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:40,581 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-11-23 20:32:40,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 20:32:40,582 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-23 20:32:40,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:40,583 INFO L225 Difference]: With dead ends: 42 [2023-11-23 20:32:40,584 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 20:32:40,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2023-11-23 20:32:40,586 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 14 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:40,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:32:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 20:32:40,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2023-11-23 20:32:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:32:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2023-11-23 20:32:40,607 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 16 [2023-11-23 20:32:40,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:40,608 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2023-11-23 20:32:40,608 INFO L496 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), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:32:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2023-11-23 20:32:40,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 20:32:40,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:40,609 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:40,638 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 20:32:40,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:40,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:40,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:40,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1298650220, now seen corresponding path program 1 times [2023-11-23 20:32:40,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:40,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122482948] [2023-11-23 20:32:40,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:40,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:40,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:32:40,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:40,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122482948] [2023-11-23 20:32:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122482948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:32:40,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:32:40,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:32:40,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143518238] [2023-11-23 20:32:40,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:32:40,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:32:40,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:40,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:32:40,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:32:40,893 INFO L87 Difference]: Start difference. First operand 38 states and 42 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, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:32:40,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:40,930 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2023-11-23 20:32:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:32:40,931 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, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-23 20:32:40,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:40,932 INFO L225 Difference]: With dead ends: 38 [2023-11-23 20:32:40,932 INFO L226 Difference]: Without dead ends: 37 [2023-11-23 20:32:40,932 INFO L412 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 [2023-11-23 20:32:40,934 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:40,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 20:32:40,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-23 20:32:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2023-11-23 20:32:40,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-23 20:32:40,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2023-11-23 20:32:40,948 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2023-11-23 20:32:40,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:40,949 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2023-11-23 20:32:40,949 INFO L496 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, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:32:40,950 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2023-11-23 20:32:40,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-23 20:32:40,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:40,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:40,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:32:40,956 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:40,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1900896519, now seen corresponding path program 1 times [2023-11-23 20:32:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075865990] [2023-11-23 20:32:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:40,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:41,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:32:41,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075865990] [2023-11-23 20:32:41,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075865990] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:41,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2114124255] [2023-11-23 20:32:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:41,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:41,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:41,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:41,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 20:32:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:41,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-23 20:32:41,480 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:41,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:32:41,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 20:32:41,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:32:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:42,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2114124255] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:32:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [68380046] [2023-11-23 20:32:42,201 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-23 20:32:42,201 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:32:42,206 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-23 20:32:42,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:32:42,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 23 [2023-11-23 20:32:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732853975] [2023-11-23 20:32:42,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:32:42,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 20:32:42,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:42,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 20:32:42,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2023-11-23 20:32:42,212 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 20:32:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:42,560 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2023-11-23 20:32:42,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 20:32:42,560 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 21 [2023-11-23 20:32:42,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:42,562 INFO L225 Difference]: With dead ends: 72 [2023-11-23 20:32:42,562 INFO L226 Difference]: Without dead ends: 39 [2023-11-23 20:32:42,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=683, Unknown=0, NotChecked=0, Total=870 [2023-11-23 20:32:42,566 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:42,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:32:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-11-23 20:32:42,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-11-23 20:32:42,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 20:32:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2023-11-23 20:32:42,587 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 21 [2023-11-23 20:32:42,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:42,587 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2023-11-23 20:32:42,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 20 states have internal predecessors, (30), 6 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 20:32:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2023-11-23 20:32:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-23 20:32:42,589 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:42,589 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:42,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 20:32:42,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:42,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:42,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1794443403, now seen corresponding path program 2 times [2023-11-23 20:32:42,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313643076] [2023-11-23 20:32:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:42,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:43,618 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 20:32:43,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313643076] [2023-11-23 20:32:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313643076] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29860110] [2023-11-23 20:32:43,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 20:32:43,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:43,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:43,623 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:43,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 20:32:43,733 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 20:32:43,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:32:43,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 69 conjunts are in the unsatisfiable core [2023-11-23 20:32:43,742 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:43,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:32:44,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-23 20:32:44,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:32:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:45,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [29860110] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:32:45,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1614606171] [2023-11-23 20:32:45,914 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-23 20:32:45,915 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:32:45,915 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-23 20:32:45,916 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:32:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 21] total 43 [2023-11-23 20:32:45,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720576621] [2023-11-23 20:32:45,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:32:45,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-23 20:32:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-23 20:32:45,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=1528, Unknown=0, NotChecked=0, Total=1806 [2023-11-23 20:32:45,920 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-23 20:32:46,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:46,834 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2023-11-23 20:32:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 20:32:46,835 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) Word has length 35 [2023-11-23 20:32:46,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:46,836 INFO L225 Difference]: With dead ends: 102 [2023-11-23 20:32:46,837 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 20:32:46,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=494, Invalid=2928, Unknown=0, NotChecked=0, Total=3422 [2023-11-23 20:32:46,840 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 63 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:46,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 298 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:32:46,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 20:32:46,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2023-11-23 20:32:46,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 25 states have (on average 1.24) internal successors, (31), 30 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 8 states have return successors, (10), 8 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 20:32:46,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2023-11-23 20:32:46,849 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 35 [2023-11-23 20:32:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:46,850 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2023-11-23 20:32:46,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 36 states have internal predecessors, (50), 12 states have call successors, (13), 8 states have call predecessors, (13), 9 states have return successors, (12), 8 states have call predecessors, (12), 9 states have call successors, (12) [2023-11-23 20:32:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2023-11-23 20:32:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-23 20:32:46,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:46,852 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:46,880 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 20:32:47,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-11-23 20:32:47,074 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:47,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1540706801, now seen corresponding path program 3 times [2023-11-23 20:32:47,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:47,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944976136] [2023-11-23 20:32:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:47,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 43 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 20:32:48,270 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:48,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944976136] [2023-11-23 20:32:48,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944976136] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:48,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554947303] [2023-11-23 20:32:48,271 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-23 20:32:48,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:48,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:48,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:48,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 20:32:48,408 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-23 20:32:48,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 20:32:48,413 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-23 20:32:48,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:48,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:32:49,079 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-11-23 20:32:49,080 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:32:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:32:52,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1554947303] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 20:32:52,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1556437121] [2023-11-23 20:32:52,432 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-23 20:32:52,432 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:32:52,432 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-23 20:32:52,433 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 20:32:52,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 31] total 55 [2023-11-23 20:32:52,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325665602] [2023-11-23 20:32:52,433 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 20:32:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-23 20:32:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:32:52,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-23 20:32:52,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=2511, Unknown=0, NotChecked=0, Total=2970 [2023-11-23 20:32:52,438 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-23 20:32:53,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:32:53,346 INFO L93 Difference]: Finished difference Result 86 states and 97 transitions. [2023-11-23 20:32:53,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 20:32:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) Word has length 49 [2023-11-23 20:32:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:32:53,351 INFO L225 Difference]: With dead ends: 86 [2023-11-23 20:32:53,351 INFO L226 Difference]: Without dead ends: 45 [2023-11-23 20:32:53,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1646 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=738, Invalid=4092, Unknown=0, NotChecked=0, Total=4830 [2023-11-23 20:32:53,359 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:32:53,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 297 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:32:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-11-23 20:32:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-11-23 20:32:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 31 states have internal predecessors, (32), 6 states have call successors, (6), 4 states have call predecessors, (6), 9 states have return successors, (11), 9 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 20:32:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2023-11-23 20:32:53,372 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 49 [2023-11-23 20:32:53,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:32:53,373 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2023-11-23 20:32:53,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 43 states have (on average 1.441860465116279) internal successors, (62), 46 states have internal predecessors, (62), 14 states have call successors, (15), 10 states have call predecessors, (15), 13 states have return successors, (18), 12 states have call predecessors, (18), 11 states have call successors, (18) [2023-11-23 20:32:53,373 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2023-11-23 20:32:53,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-23 20:32:53,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:32:53,380 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:32:53,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 20:32:53,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-23 20:32:53,583 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_22_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:32:53,584 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:32:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash -630751917, now seen corresponding path program 4 times [2023-11-23 20:32:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:32:53,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54780807] [2023-11-23 20:32:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:32:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:32:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:58,032 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2023-11-23 20:32:58,032 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:32:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54780807] [2023-11-23 20:32:58,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54780807] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:32:58,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945800103] [2023-11-23 20:32:58,032 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-23 20:32:58,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:32:58,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:32:58,039 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:32:58,058 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 20:32:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:32:58,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 73 conjunts are in the unsatisfiable core [2023-11-23 20:32:58,193 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:32:58,200 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 44 treesize of output 42 [2023-11-23 20:32:58,216 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 [2023-11-23 20:32:58,234 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 [2023-11-23 20:33:00,418 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from false [2023-11-23 20:33:02,422 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) is different from true [2023-11-23 20:33:04,479 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-23 20:33:06,481 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-23 20:33:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 97 trivial. 11 not checked. [2023-11-23 20:33:06,640 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 20:33:06,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945800103] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:33:06,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1636171821] [2023-11-23 20:33:06,913 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-11-23 20:33:06,913 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 20:33:06,913 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-11-23 20:33:06,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 20:33:06,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 15 [2023-11-23 20:33:06,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169354361] [2023-11-23 20:33:06,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 20:33:06,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 20:33:06,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:33:06,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 20:33:06,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=257, Unknown=7, NotChecked=66, Total=380 [2023-11-23 20:33:06,916 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 20:33:07,092 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from false [2023-11-23 20:33:07,098 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))) (and (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_24| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int)_AFTER_CALL_24| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_24| .cse1 (select |c_#memory_int| .cse1)) |c_#memory_int|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse1) (= |v_old(#memory_int)_AFTER_CALL_24| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_24| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))))))) (or .cse0 (exists ((|v_old(#memory_int)_AFTER_CALL_25| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_25| |c_#memory_int|))) (and (= (store |v_old(#memory_int)_AFTER_CALL_25| .cse2 (select |c_#memory_int| .cse2)) |c_#memory_int|) (= |v_old(#memory_int)_AFTER_CALL_25| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_old(#memory_int)_AFTER_CALL_25| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse2))))) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| c_func_to_recursive_line_23_to_23_0_~c.base) (= (store |c_old(#memory_int)| c_func_to_recursive_line_23_to_23_0_~c.base (select |c_#memory_int| c_func_to_recursive_line_23_to_23_0_~c.base)) |c_#memory_int|))) is different from true [2023-11-23 20:33:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:33:07,205 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2023-11-23 20:33:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-23 20:33:07,206 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 56 [2023-11-23 20:33:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:33:07,207 INFO L225 Difference]: With dead ends: 55 [2023-11-23 20:33:07,208 INFO L226 Difference]: Without dead ends: 51 [2023-11-23 20:33:07,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 68 SyntacticMatches, 6 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=107, Invalid=546, Unknown=9, NotChecked=150, Total=812 [2023-11-23 20:33:07,209 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 32 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:33:07,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 151 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 101 Unchecked, 0.1s Time] [2023-11-23 20:33:07,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-11-23 20:33:07,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-11-23 20:33:07,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 35 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 9 states have return successors, (12), 10 states have call predecessors, (12), 5 states have call successors, (12) [2023-11-23 20:33:07,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-11-23 20:33:07,218 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 56 [2023-11-23 20:33:07,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:33:07,218 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-11-23 20:33:07,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 11 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-23 20:33:07,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-11-23 20:33:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 20:33:07,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:33:07,220 INFO L195 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] [2023-11-23 20:33:07,243 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 20:33:07,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:33:07,442 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_21_to_22_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_23_to_23_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_23_to_23_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 4 more)] === [2023-11-23 20:33:07,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:33:07,442 INFO L85 PathProgramCache]: Analyzing trace with hash 104174786, now seen corresponding path program 1 times [2023-11-23 20:33:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:33:07,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481065650] [2023-11-23 20:33:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:33:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:33:07,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:33:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-11-23 20:33:11,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:33:11,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481065650] [2023-11-23 20:33:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481065650] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 20:33:11,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388865328] [2023-11-23 20:33:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:33:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 20:33:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:33:11,031 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 20:33:11,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_64f29aaa-fc73-403d-b14e-1c1214d1f704/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 20:33:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:33:11,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-23 20:33:11,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 20:33:11,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 20:33:11,208 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 18 treesize of output 16 [2023-11-23 20:33:11,284 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 19 treesize of output 18 [2023-11-23 20:33:13,583 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from false [2023-11-23 20:33:15,585 WARN L876 $PredicateComparison]: unable to prove that (or (= |c_#memory_int| (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |c_#memory_int| |c_func_to_recursive_line_23_to_23_0_#in~c.base|))) (exists ((|v_#memory_int_BEFORE_CALL_65| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_int_BEFORE_CALL_65| |c_#memory_int|))) (and (= (store |v_#memory_int_BEFORE_CALL_65| .cse0 (select |c_#memory_int| .cse0)) |c_#memory_int|) (= (store |c_old(#memory_int)| |c_func_to_recursive_line_23_to_23_0_#in~c.base| (select |v_#memory_int_BEFORE_CALL_65| |c_func_to_recursive_line_23_to_23_0_#in~c.base|)) |v_#memory_int_BEFORE_CALL_65|) (= |c_func_to_recursive_line_23_to_23_0_#in~c.base| .cse0))))) is different from true [2023-11-23 20:33:17,718 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-23 20:33:17,720 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-23 20:33:19,745 WARN L854 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (<= |c_func_to_recursive_line_22_to_23_0_#t~mem8| (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-23 20:33:19,748 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((func_to_recursive_line_22_to_23_0_~c.base Int)) (= (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base (select |c_#memory_int| func_to_recursive_line_22_to_23_0_~c.base)) |c_#memory_int|)) (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |c_#memory_int|))) (and (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0))) (= |c_#memory_int| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |c_#memory_int| .cse0))))))) (<= |c_func_to_recursive_line_22_to_23_0_#t~mem8| (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset)) (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-23 20:33:19,816 WARN L854 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset))) (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (and (<= .cse0 (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)) (= (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse3 (select |v_#memory_int_312| .cse3))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_36| .cse3)))))) (= (store |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|) (<= .cse0 (+ 1 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset)))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from false [2023-11-23 20:33:19,821 WARN L876 $PredicateComparison]: unable to prove that (and (= c_func_to_recursive_line_22_to_23_0_~b.offset |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) (let ((.cse0 (select (select |c_#memory_int| c_func_to_recursive_line_22_to_23_0_~b.base) c_func_to_recursive_line_22_to_23_0_~b.offset))) (or (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse2 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_22_to_23_0_~b.base))) (and (<= .cse0 (+ (select .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset) 1)) (= (store .cse2 c_func_to_recursive_line_22_to_23_0_~b.base (store .cse1 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|))))) (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse4 (select |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse3 (select |v_#memory_int_312| .cse3))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse3 (select |v_old(#memory_int)_AFTER_CALL_36| .cse3)))))) (= (store |v_#memory_int_312| c_func_to_recursive_line_22_to_23_0_~b.base (store .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset .cse0)) |c_#memory_int|) (<= .cse0 (+ 1 (select .cse4 c_func_to_recursive_line_22_to_23_0_~b.offset)))))))) (= |c_func_to_recursive_line_22_to_23_0_#in~b.base| c_func_to_recursive_line_22_to_23_0_~b.base)) is different from true [2023-11-23 20:33:19,912 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (or (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |v_#memory_int_312| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)))))) (= (store |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)) (= |c_#memory_int| (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)))))))) (<= 6 .cse2))) is different from false [2023-11-23 20:33:19,915 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_func_to_recursive_line_22_to_23_0_#in~b.base|) |c_func_to_recursive_line_22_to_23_0_#in~b.offset|))) (and (or (exists ((|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse1 (select |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= |v_#memory_int_312| (store |v_old(#memory_int)_AFTER_CALL_36| .cse0 (select |v_#memory_int_312| .cse0))) (= |v_old(#memory_int)_AFTER_CALL_36| (store |c_old(#memory_int)| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)))))) (= (store |v_#memory_int_312| |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)) |c_#memory_int|) (<= .cse2 (+ (select .cse1 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1))))) (exists ((v_DerPreprocessor_7 (Array Int Int)) (func_to_recursive_line_22_to_23_0_~c.base Int)) (let ((.cse4 (store |c_old(#memory_int)| func_to_recursive_line_22_to_23_0_~c.base v_DerPreprocessor_7))) (let ((.cse3 (select .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base|))) (and (<= .cse2 (+ (select .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset|) 1)) (= |c_#memory_int| (store .cse4 |c_func_to_recursive_line_22_to_23_0_#in~b.base| (store .cse3 |c_func_to_recursive_line_22_to_23_0_#in~b.offset| .cse2)))))))) (<= 6 .cse2))) is different from true [2023-11-23 20:33:20,108 INFO L349 Elim1Store]: treesize reduction 95, result has 34.5 percent of original size [2023-11-23 20:33:20,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 148 treesize of output 246 [2023-11-23 20:33:20,250 INFO L349 Elim1Store]: treesize reduction 132, result has 9.6 percent of original size [2023-11-23 20:33:20,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 10 case distinctions, treesize of input 66 treesize of output 60 [2023-11-23 20:33:20,292 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 5 treesize of output 3 [2023-11-23 20:33:20,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 70 [2023-11-23 20:33:20,461 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:20,463 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:20,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2023-11-23 20:33:20,493 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:20,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 20:33:20,504 INFO L349 Elim1Store]: treesize reduction 55, result has 1.8 percent of original size [2023-11-23 20:33:20,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 40 [2023-11-23 20:33:22,713 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~a.base))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= (select (select (store |c_#memory_int| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)) c_func_to_recursive_line_21_to_22_0_~a.base) c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (not (= .cse0 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse0) func_to_recursive_line_21_to_22_0_~b.offset))))) (and (= (select .cse1 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (not (= .cse2 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse2) func_to_recursive_line_21_to_22_0_~b.offset))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_14) .cse4 (select |v_old(#memory_int)_AFTER_CALL_36| .cse4))) func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse3 func_to_recursive_line_21_to_22_0_~b.offset) 0) (= .cse3 v_DerPreprocessor_14)))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse7 (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_10) .cse8 (select |v_old(#memory_int)_AFTER_CALL_36| .cse8))))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_21_to_22_0_~a.base)) (.cse6 (select .cse7 func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse5 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (= .cse5 .cse1) (= 0 (select .cse6 func_to_recursive_line_21_to_22_0_~b.offset)) (= .cse6 v_DerPreprocessor_10))))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) is different from false [2023-11-23 20:33:22,716 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| c_func_to_recursive_line_21_to_22_0_~a.base))) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse0 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (= (select (select (store |c_#memory_int| .cse0 (select |v_old(#memory_int)_AFTER_CALL_36| .cse0)) c_func_to_recursive_line_21_to_22_0_~a.base) c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (not (= .cse0 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse0) func_to_recursive_line_21_to_22_0_~b.offset))))) (and (= (select .cse1 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (or (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (func_to_recursive_line_21_to_22_0_~b.offset Int)) (let ((.cse2 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (and (not (= .cse2 c_func_to_recursive_line_21_to_22_0_~a.base)) (<= 6 (select (select |c_#memory_int| .cse2) func_to_recursive_line_21_to_22_0_~b.offset))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int))) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_14) .cse4 (select |v_old(#memory_int)_AFTER_CALL_36| .cse4))) func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse3 func_to_recursive_line_21_to_22_0_~b.offset) 0) (= .cse3 v_DerPreprocessor_14)))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) (exists ((func_to_recursive_line_21_to_22_0_~b.base Int)) (and (not (= c_func_to_recursive_line_21_to_22_0_~a.base func_to_recursive_line_21_to_22_0_~b.base)) (exists ((func_to_recursive_line_21_to_22_0_~b.offset Int)) (and (exists ((v_DerPreprocessor_10 (Array Int Int)) (|v_old(#memory_int)_AFTER_CALL_36| (Array Int (Array Int Int))) (|v_#memory_int_312| (Array Int (Array Int Int)))) (let ((.cse7 (let ((.cse8 (@diff |v_old(#memory_int)_AFTER_CALL_36| |v_#memory_int_312|))) (store (store |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base v_DerPreprocessor_10) .cse8 (select |v_old(#memory_int)_AFTER_CALL_36| .cse8))))) (let ((.cse5 (select .cse7 c_func_to_recursive_line_21_to_22_0_~a.base)) (.cse6 (select .cse7 func_to_recursive_line_21_to_22_0_~b.base))) (and (= (select .cse5 c_func_to_recursive_line_21_to_22_0_~a.offset) 0) (= .cse5 .cse1) (= 0 (select .cse6 func_to_recursive_line_21_to_22_0_~b.offset)) (= .cse6 v_DerPreprocessor_10))))) (<= 6 (select (select |c_#memory_int| func_to_recursive_line_21_to_22_0_~b.base) func_to_recursive_line_21_to_22_0_~b.offset)))))))) is different from true [2023-11-23 20:33:22,872 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 20:33:22,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 468 treesize of output 530 [2023-11-23 20:33:22,932 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 5 treesize of output 3 [2023-11-23 20:33:23,176 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 5 treesize of output 3