./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/config/TaipanReach.xml -i ../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ad27d809606deb561fe152191ab0a1443c0552410f06ac9bb9a7a7bf17dec4e9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 05:57:29,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 05:57:29,844 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-09 05:57:29,852 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 05:57:29,853 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 05:57:29,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 05:57:29,904 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 05:57:29,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 05:57:29,906 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 05:57:29,906 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 05:57:29,907 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 05:57:29,907 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 05:57:29,908 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 05:57:29,908 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 05:57:29,909 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 05:57:29,909 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 05:57:29,910 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 05:57:29,910 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 05:57:29,911 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 05:57:29,911 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 05:57:29,912 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 05:57:29,913 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 05:57:29,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 05:57:29,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 05:57:29,914 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 05:57:29,915 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 05:57:29,915 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 05:57:29,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 05:57:29,916 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 05:57:29,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 05:57:29,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 05:57:29,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 05:57:29,918 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-09 05:57:29,918 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 05:57:29,919 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 05:57:29,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 05:57:29,919 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 05:57:29,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 05:57:29,920 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 05:57:29,921 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 05:57:29,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:57:29,922 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 05:57:29,922 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 05:57:29,922 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 05:57:29,923 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 05:57:29,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 05:57:29,923 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 05:57:29,924 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 05:57:29,924 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 05:57:29,924 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_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ad27d809606deb561fe152191ab0a1443c0552410f06ac9bb9a7a7bf17dec4e9 [2024-11-09 05:57:30,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 05:57:30,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 05:57:30,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 05:57:30,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 05:57:30,361 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 05:57:30,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c Unable to find full path for "g++" [2024-11-09 05:57:32,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 05:57:33,071 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 05:57:33,072 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c [2024-11-09 05:57:33,081 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/data/85924e3a6/c3f1f73726604636aff910e89d083726/FLAGcca1e3cd9 [2024-11-09 05:57:33,102 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/data/85924e3a6/c3f1f73726604636aff910e89d083726 [2024-11-09 05:57:33,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 05:57:33,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 05:57:33,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 05:57:33,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 05:57:33,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 05:57:33,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27e0f9fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33, skipping insertion in model container [2024-11-09 05:57:33,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,153 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 05:57:33,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:57:33,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 05:57:33,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 05:57:33,538 INFO L204 MainTranslator]: Completed translation [2024-11-09 05:57:33,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33 WrapperNode [2024-11-09 05:57:33,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 05:57:33,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 05:57:33,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 05:57:33,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 05:57:33,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,558 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,584 INFO L138 Inliner]: procedures = 16, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-09 05:57:33,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 05:57:33,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 05:57:33,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 05:57:33,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 05:57:33,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,600 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,612 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 05:57:33,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 05:57:33,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 05:57:33,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 05:57:33,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (1/1) ... [2024-11-09 05:57:33,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 05:57:33,640 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:33,664 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 05:57:33,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 05:57:33,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 05:57:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 05:57:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 05:57:33,708 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2024-11-09 05:57:33,708 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2024-11-09 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 05:57:33,709 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 05:57:33,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 05:57:33,802 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 05:57:33,805 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 05:57:34,197 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-09 05:57:34,197 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 05:57:34,246 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 05:57:34,246 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 05:57:34,247 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:57:34 BoogieIcfgContainer [2024-11-09 05:57:34,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 05:57:34,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 05:57:34,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 05:57:34,256 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 05:57:34,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 05:57:33" (1/3) ... [2024-11-09 05:57:34,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65830a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:57:34, skipping insertion in model container [2024-11-09 05:57:34,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 05:57:33" (2/3) ... [2024-11-09 05:57:34,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65830a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 05:57:34, skipping insertion in model container [2024-11-09 05:57:34,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 05:57:34" (3/3) ... [2024-11-09 05:57:34,260 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_ps2-ll.c [2024-11-09 05:57:34,284 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 05:57:34,285 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-11-09 05:57:34,375 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 05:57:34,390 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@148f4f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 05:57:34,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-09 05:57:34,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 54 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 05:57:34,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 05:57:34,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:34,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 05:57:34,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_26_to_34_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:34,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash 114185027, now seen corresponding path program 1 times [2024-11-09 05:57:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239784943] [2024-11-09 05:57:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:34,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:57:34,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1948936206] [2024-11-09 05:57:34,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:34,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:34,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:34,697 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:57:34,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 05:57:34,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:34,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 05:57:34,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:57:35,120 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 05:57:35,122 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2024-11-09 05:57:35,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:35,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:35,195 INFO L349 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2024-11-09 05:57:35,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 36 [2024-11-09 05:57:35,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:35,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2024-11-09 05:57:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:35,482 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:57:35,483 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:35,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239784943] [2024-11-09 05:57:35,484 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:57:35,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948936206] [2024-11-09 05:57:35,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948936206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:35,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:35,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:57:35,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394824987] [2024-11-09 05:57:35,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:35,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:57:35,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:57:35,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:57:35,539 INFO L87 Difference]: Start difference. First operand has 60 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 54 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:35,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:35,842 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2024-11-09 05:57:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:35,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 05:57:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:35,855 INFO L225 Difference]: With dead ends: 124 [2024-11-09 05:57:35,856 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:57:35,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:35,867 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:35,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 200 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:57:35,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2024-11-09 05:57:35,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.6744186046511629) internal successors, (72), 65 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:35,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-09 05:57:35,944 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 5 [2024-11-09 05:57:35,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:35,945 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-09 05:57:35,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-09 05:57:35,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 05:57:35,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:35,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:35,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-09 05:57:36,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-09 05:57:36,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_26_to_34_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:36,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:36,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1937336731, now seen corresponding path program 1 times [2024-11-09 05:57:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013314892] [2024-11-09 05:57:36,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:36,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:36,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:36,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013314892] [2024-11-09 05:57:36,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013314892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:36,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:36,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:57:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614718075] [2024-11-09 05:57:36,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:36,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:57:36,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:36,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:57:36,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:57:36,823 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:37,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:37,155 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-09 05:57:37,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:37,156 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-09 05:57:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:37,158 INFO L225 Difference]: With dead ends: 87 [2024-11-09 05:57:37,158 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 05:57:37,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:37,160 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 49 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:37,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 184 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:57:37,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 05:57:37,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-11-09 05:57:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.627906976744186) internal successors, (70), 65 states have internal predecessors, (70), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-09 05:57:37,187 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 7 [2024-11-09 05:57:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:37,188 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-09 05:57:37,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-09 05:57:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 05:57:37,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:37,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:37,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 05:57:37,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_26_to_34_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:37,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:37,190 INFO L85 PathProgramCache]: Analyzing trace with hash -2059757177, now seen corresponding path program 1 times [2024-11-09 05:57:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106594275] [2024-11-09 05:57:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:37,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:37,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:37,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106594275] [2024-11-09 05:57:37,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106594275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:37,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:37,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:57:37,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320905466] [2024-11-09 05:57:37,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:37,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:57:37,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:37,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:57:37,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:57:37,622 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:37,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:37,975 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-09 05:57:37,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:37,976 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 05:57:37,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:37,978 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:57:37,978 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 05:57:37,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:57:37,980 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 52 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:37,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 186 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:57:37,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 05:57:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2024-11-09 05:57:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.6046511627906976) internal successors, (69), 65 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-09 05:57:37,992 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 9 [2024-11-09 05:57:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:37,993 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-09 05:57:37,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-09 05:57:37,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-09 05:57:37,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:37,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:37,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 05:57:37,995 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_26_to_34_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:37,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:37,995 INFO L85 PathProgramCache]: Analyzing trace with hash 572037024, now seen corresponding path program 1 times [2024-11-09 05:57:37,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:37,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820467021] [2024-11-09 05:57:37,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:38,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:38,490 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:38,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820467021] [2024-11-09 05:57:38,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820467021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:38,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:38,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:57:38,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060058400] [2024-11-09 05:57:38,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:38,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:57:38,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:38,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:57:38,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:57:38,494 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:38,986 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-09 05:57:38,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:38,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-09 05:57:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:38,987 INFO L225 Difference]: With dead ends: 84 [2024-11-09 05:57:38,988 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 05:57:38,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:38,989 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:38,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 185 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:57:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 05:57:39,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2024-11-09 05:57:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.5813953488372092) internal successors, (68), 65 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-09 05:57:39,008 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 10 [2024-11-09 05:57:39,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:39,008 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-09 05:57:39,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:39,009 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-09 05:57:39,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 05:57:39,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:39,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:39,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 05:57:39,010 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_26_to_34_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:39,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash 553278633, now seen corresponding path program 1 times [2024-11-09 05:57:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:39,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380317869] [2024-11-09 05:57:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:39,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:39,534 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380317869] [2024-11-09 05:57:39,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380317869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:39,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:39,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 05:57:39,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318829149] [2024-11-09 05:57:39,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:39,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:57:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:39,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:57:39,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:57:39,537 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:39,870 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-09 05:57:39,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:39,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-09 05:57:39,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:39,872 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:57:39,873 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 05:57:39,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:57:39,874 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:39,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 218 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:57:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 05:57:39,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2024-11-09 05:57:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.558139534883721) internal successors, (67), 65 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:39,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-09 05:57:39,886 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-11-09 05:57:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:39,887 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-09 05:57:39,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-09 05:57:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 05:57:39,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:39,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:39,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 05:57:39,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_26_to_34_0Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:39,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:39,890 INFO L85 PathProgramCache]: Analyzing trace with hash -28231486, now seen corresponding path program 1 times [2024-11-09 05:57:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:39,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572886813] [2024-11-09 05:57:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:39,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:40,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:40,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572886813] [2024-11-09 05:57:40,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572886813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:40,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:40,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:57:40,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772112462] [2024-11-09 05:57:40,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:40,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 05:57:40,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:40,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 05:57:40,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:57:40,405 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:40,707 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-09 05:57:40,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:40,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-09 05:57:40,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:40,709 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:57:40,710 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:57:40,711 INFO L431 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 [2024-11-09 05:57:40,712 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 32 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:40,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 195 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:40,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:57:40,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2024-11-09 05:57:40,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 65 states have internal predecessors, (66), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-09 05:57:40,732 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 12 [2024-11-09 05:57:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:40,732 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-09 05:57:40,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 05:57:40,732 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-09 05:57:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 05:57:40,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:40,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:40,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 05:57:40,738 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_26_to_34_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 2086856296, now seen corresponding path program 1 times [2024-11-09 05:57:40,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:40,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249438120] [2024-11-09 05:57:40,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:40,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:40,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:40,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:40,968 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:40,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249438120] [2024-11-09 05:57:40,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249438120] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:40,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:40,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:57:40,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133859332] [2024-11-09 05:57:40,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:40,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:57:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:57:40,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:57:40,972 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:41,142 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2024-11-09 05:57:41,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:41,143 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 18 [2024-11-09 05:57:41,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:41,144 INFO L225 Difference]: With dead ends: 93 [2024-11-09 05:57:41,144 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 05:57:41,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:57:41,145 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:41,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 208 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:57:41,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 05:57:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-11-09 05:57:41,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 66 states have internal predecessors, (67), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:41,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-09 05:57:41,156 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 18 [2024-11-09 05:57:41,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:41,157 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-09 05:57:41,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:41,157 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-09 05:57:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 05:57:41,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:41,158 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:41,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 05:57:41,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_26_to_34_0Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:41,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:41,159 INFO L85 PathProgramCache]: Analyzing trace with hash 268035821, now seen corresponding path program 1 times [2024-11-09 05:57:41,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:41,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104499125] [2024-11-09 05:57:41,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:41,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:41,358 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:41,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104499125] [2024-11-09 05:57:41,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104499125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:41,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:41,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:57:41,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178239843] [2024-11-09 05:57:41,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:41,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:57:41,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:41,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:57:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:57:41,361 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:41,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:41,533 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2024-11-09 05:57:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:41,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (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 19 [2024-11-09 05:57:41,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:41,535 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:57:41,536 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 05:57:41,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:57:41,539 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 35 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:41,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 210 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:57:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 05:57:41,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2024-11-09 05:57:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 45 states have (on average 1.511111111111111) internal successors, (68), 67 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-09 05:57:41,560 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 19 [2024-11-09 05:57:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:41,560 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-09 05:57:41,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-09 05:57:41,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 05:57:41,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:41,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:41,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 05:57:41,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_26_to_34_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:41,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:41,563 INFO L85 PathProgramCache]: Analyzing trace with hash -280824054, now seen corresponding path program 1 times [2024-11-09 05:57:41,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:41,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220087974] [2024-11-09 05:57:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:41,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:42,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:42,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220087974] [2024-11-09 05:57:42,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220087974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:42,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:42,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:57:42,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031249576] [2024-11-09 05:57:42,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:42,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:57:42,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:42,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:57:42,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:57:42,105 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:42,343 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-09 05:57:42,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:57:42,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 20 [2024-11-09 05:57:42,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:42,345 INFO L225 Difference]: With dead ends: 91 [2024-11-09 05:57:42,345 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 05:57:42,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:57:42,347 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:42,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 235 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 05:57:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2024-11-09 05:57:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 46 states have (on average 1.5) internal successors, (69), 68 states have internal predecessors, (69), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-09 05:57:42,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-09 05:57:42,357 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 20 [2024-11-09 05:57:42,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:42,357 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-09 05:57:42,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-09 05:57:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:57:42,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:42,359 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:42,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 05:57:42,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:42,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:42,372 INFO L85 PathProgramCache]: Analyzing trace with hash -116063398, now seen corresponding path program 1 times [2024-11-09 05:57:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:42,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866918780] [2024-11-09 05:57:42,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:42,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:57:42,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1157978376] [2024-11-09 05:57:42,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:42,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:42,411 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:57:42,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 05:57:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:42,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 05:57:42,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:57:42,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:42,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:42,659 INFO L349 Elim1Store]: treesize reduction 92, result has 25.2 percent of original size [2024-11-09 05:57:42,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 114 [2024-11-09 05:57:42,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:42,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 62 [2024-11-09 05:57:42,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:57:42,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:57:42,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:57:42,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:57:43,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-09 05:57:43,013 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 [2024-11-09 05:57:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:43,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 05:57:43,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866918780] [2024-11-09 05:57:43,080 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:57:43,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157978376] [2024-11-09 05:57:43,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157978376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:43,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:43,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 05:57:43,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911171712] [2024-11-09 05:57:43,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 05:57:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:43,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 05:57:43,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 05:57:43,083 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:43,213 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-09 05:57:43,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-09 05:57:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:43,216 INFO L225 Difference]: With dead ends: 92 [2024-11-09 05:57:43,216 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 05:57:43,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 05:57:43,217 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:43,218 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 124 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:57:43,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 05:57:43,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2024-11-09 05:57:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.46) internal successors, (73), 71 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-09 05:57:43,227 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2024-11-09 05:57:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:43,228 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-09 05:57:43,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:43,229 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-09 05:57:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 05:57:43,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:43,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:43,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 05:57:43,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-09 05:57:43,431 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_26_to_34_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:43,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:43,432 INFO L85 PathProgramCache]: Analyzing trace with hash -115610993, now seen corresponding path program 1 times [2024-11-09 05:57:43,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:43,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148602109] [2024-11-09 05:57:43,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:44,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:44,141 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:44,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148602109] [2024-11-09 05:57:44,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148602109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:44,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:44,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 05:57:44,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524304260] [2024-11-09 05:57:44,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:44,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 05:57:44,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:44,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 05:57:44,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 05:57:44,148 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:44,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:44,560 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-11-09 05:57:44,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:57:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 21 [2024-11-09 05:57:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:44,562 INFO L225 Difference]: With dead ends: 90 [2024-11-09 05:57:44,562 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 05:57:44,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 05:57:44,564 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 34 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:44,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 262 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 05:57:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-09 05:57:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 72 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-09 05:57:44,579 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 21 [2024-11-09 05:57:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:44,579 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-09 05:57:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-09 05:57:44,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 05:57:44,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:44,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 05:57:44,583 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_26_to_34_0Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:44,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:44,583 INFO L85 PathProgramCache]: Analyzing trace with hash 711026604, now seen corresponding path program 1 times [2024-11-09 05:57:44,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:44,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84379665] [2024-11-09 05:57:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:44,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:45,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:45,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:45,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84379665] [2024-11-09 05:57:45,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84379665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:45,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:45,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:57:45,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258909185] [2024-11-09 05:57:45,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:45,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:57:45,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:45,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:57:45,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:45,026 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:45,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:45,250 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-09 05:57:45,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 05:57:45,251 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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 22 [2024-11-09 05:57:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:45,252 INFO L225 Difference]: With dead ends: 85 [2024-11-09 05:57:45,252 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 05:57:45,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:57:45,253 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 27 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:45,253 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 235 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 05:57:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-09 05:57:45,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 73 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-09 05:57:45,262 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 22 [2024-11-09 05:57:45,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:45,262 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-09 05:57:45,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:45,263 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-09 05:57:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:57:45,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:45,265 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:45,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 05:57:45,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:45,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:45,266 INFO L85 PathProgramCache]: Analyzing trace with hash 132225436, now seen corresponding path program 1 times [2024-11-09 05:57:45,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:45,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95490284] [2024-11-09 05:57:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:45,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:45,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:45,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:45,454 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:45,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95490284] [2024-11-09 05:57:45,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95490284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:45,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:45,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:57:45,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332501548] [2024-11-09 05:57:45,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:45,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:57:45,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:45,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:57:45,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:45,457 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:45,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:45,736 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-09 05:57:45,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:57:45,737 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-09 05:57:45,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:45,738 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:57:45,739 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:57:45,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:57:45,740 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 52 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:45,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 105 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:57:45,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:57:45,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 72 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-09 05:57:45,751 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 23 [2024-11-09 05:57:45,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:45,751 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-09 05:57:45,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-09 05:57:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 05:57:45,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:45,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:45,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 05:57:45,755 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_26_to_34_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:45,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:45,755 INFO L85 PathProgramCache]: Analyzing trace with hash 566988337, now seen corresponding path program 1 times [2024-11-09 05:57:45,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:45,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875137687] [2024-11-09 05:57:45,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:45,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:45,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:46,219 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:46,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875137687] [2024-11-09 05:57:46,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875137687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:46,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:46,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 05:57:46,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822068277] [2024-11-09 05:57:46,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:46,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 05:57:46,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:46,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 05:57:46,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 05:57:46,223 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:46,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:46,418 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-09 05:57:46,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:46,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 23 [2024-11-09 05:57:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:46,420 INFO L225 Difference]: With dead ends: 83 [2024-11-09 05:57:46,420 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 05:57:46,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:57:46,421 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 21 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:46,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 238 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:57:46,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 05:57:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-09 05:57:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 73 states have internal predecessors, (75), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-09 05:57:46,430 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 23 [2024-11-09 05:57:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:46,431 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-09 05:57:46,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:46,431 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-09 05:57:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 05:57:46,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:46,432 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:46,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 05:57:46,433 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:46,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:46,433 INFO L85 PathProgramCache]: Analyzing trace with hash -195978738, now seen corresponding path program 1 times [2024-11-09 05:57:46,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:46,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390490653] [2024-11-09 05:57:46,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:46,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:46,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:46,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:46,589 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:46,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390490653] [2024-11-09 05:57:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390490653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:46,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:57:46,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020092287] [2024-11-09 05:57:46,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:46,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:57:46,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:46,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:57:46,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:46,592 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:46,857 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-09 05:57:46,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 05:57:46,858 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2024-11-09 05:57:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:46,859 INFO L225 Difference]: With dead ends: 82 [2024-11-09 05:57:46,859 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 05:57:46,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:57:46,861 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:46,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 88 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 05:57:46,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 05:57:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 05:57:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 72 states have internal predecessors, (74), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:46,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-09 05:57:46,870 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 24 [2024-11-09 05:57:46,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:46,871 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-09 05:57:46,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:46,871 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-09 05:57:46,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 05:57:46,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:46,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:46,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 05:57:46,872 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:46,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:46,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1780373538, now seen corresponding path program 1 times [2024-11-09 05:57:46,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:46,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494008861] [2024-11-09 05:57:46,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:46,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:47,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:47,137 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:47,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494008861] [2024-11-09 05:57:47,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494008861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:47,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:47,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 05:57:47,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891223757] [2024-11-09 05:57:47,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:47,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 05:57:47,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:47,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 05:57:47,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:57:47,142 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 9 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:47,446 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-09 05:57:47,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:47,446 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2024-11-09 05:57:47,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:47,447 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:57:47,447 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 05:57:47,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-09 05:57:47,448 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:47,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 147 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:57:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 05:57:47,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-09 05:57:47,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 56 states have (on average 1.375) internal successors, (77), 75 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-09 05:57:47,461 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 25 [2024-11-09 05:57:47,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:47,461 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-09 05:57:47,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:47,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-09 05:57:47,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 05:57:47,463 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:47,463 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:47,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 05:57:47,464 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:47,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:47,465 INFO L85 PathProgramCache]: Analyzing trace with hash 642995216, now seen corresponding path program 1 times [2024-11-09 05:57:47,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34237981] [2024-11-09 05:57:47,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:47,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:47,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:47,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:47,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34237981] [2024-11-09 05:57:47,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34237981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:47,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:47,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:57:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049612621] [2024-11-09 05:57:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:47,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:57:47,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:57:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:47,842 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:48,282 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-09 05:57:48,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:48,283 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2024-11-09 05:57:48,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:48,286 INFO L225 Difference]: With dead ends: 88 [2024-11-09 05:57:48,286 INFO L226 Difference]: Without dead ends: 87 [2024-11-09 05:57:48,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:57:48,287 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 65 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:48,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 111 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:57:48,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-09 05:57:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-09 05:57:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.368421052631579) internal successors, (78), 76 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 05:57:48,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-09 05:57:48,299 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 26 [2024-11-09 05:57:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:48,299 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-09 05:57:48,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:48,300 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-09 05:57:48,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:57:48,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:48,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:48,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 05:57:48,304 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting func_to_recursive_line_26_to_34_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:48,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:48,305 INFO L85 PathProgramCache]: Analyzing trace with hash 406656694, now seen corresponding path program 1 times [2024-11-09 05:57:48,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:48,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057986619] [2024-11-09 05:57:48,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:48,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:57:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1880330327] [2024-11-09 05:57:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:48,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:48,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:48,345 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:57:48,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 05:57:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:48,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-09 05:57:48,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:57:48,561 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-09 05:57:48,562 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 44 [2024-11-09 05:57:48,605 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:57:48,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 86 [2024-11-09 05:57:48,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:48,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:48,669 INFO L349 Elim1Store]: treesize reduction 38, result has 35.6 percent of original size [2024-11-09 05:57:48,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 61 [2024-11-09 05:57:48,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 05:57:49,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-11-09 05:57:49,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-11-09 05:57:49,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:57:49,345 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 22 treesize of output 10 [2024-11-09 05:57:49,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:49,374 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:57:49,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem5_17| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem4_17| Int) (v_ArrVal_389 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base (store (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset v_ArrVal_387)) c_func_to_recursive_line_26_to_34_0_~x.base v_ArrVal_389) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (< |v_func_to_recursive_line_26_to_34_0_#t~mem5_17| .cse0) (< |v_func_to_recursive_line_26_to_34_0_#t~mem4_17| .cse0) (< v_ArrVal_387 (+ |c_func_to_recursive_line_26_to_34_0_#t~mem11| 1)) (< 0 (+ 9223372036854775809 (* |v_func_to_recursive_line_26_to_34_0_#t~mem5_17| |v_func_to_recursive_line_26_to_34_0_#t~mem4_17|)))))) is different from false [2024-11-09 05:57:49,942 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 Int) (v_ArrVal_385 Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem5_17| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem4_17| Int) (v_ArrVal_389 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base (store (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base) c_func_to_recursive_line_26_to_34_0_~c.offset v_ArrVal_385)))) (let ((.cse1 (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse0 (select (select (store (store .cse2 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset v_ArrVal_387)) c_func_to_recursive_line_26_to_34_0_~x.base v_ArrVal_389) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (< v_ArrVal_385 (+ |c_func_to_recursive_line_26_to_34_0_#t~mem10| 1)) (< |v_func_to_recursive_line_26_to_34_0_#t~mem4_17| .cse0) (< v_ArrVal_387 (+ (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset) 1)) (< |v_func_to_recursive_line_26_to_34_0_#t~mem5_17| .cse0) (< 0 (+ 9223372036854775809 (* |v_func_to_recursive_line_26_to_34_0_#t~mem5_17| |v_func_to_recursive_line_26_to_34_0_#t~mem4_17|)))))))) is different from false [2024-11-09 05:57:50,057 WARN L851 $PredicateComparison]: unable to prove that (forall ((func_to_recursive_line_26_to_34_0_~c.offset Int) (v_ArrVal_387 Int) (v_ArrVal_385 Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem5_17| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem4_17| Int) (v_ArrVal_389 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base))) (let ((.cse3 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base (store .cse0 func_to_recursive_line_26_to_34_0_~c.offset v_ArrVal_385)))) (let ((.cse2 (select .cse3 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse1 (select (select (store (store .cse3 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset v_ArrVal_387)) c_func_to_recursive_line_26_to_34_0_~x.base v_ArrVal_389) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (< v_ArrVal_385 (+ (select .cse0 func_to_recursive_line_26_to_34_0_~c.offset) 1)) (< |v_func_to_recursive_line_26_to_34_0_#t~mem4_17| .cse1) (< 0 (+ 9223372036854775809 (* |v_func_to_recursive_line_26_to_34_0_#t~mem5_17| |v_func_to_recursive_line_26_to_34_0_#t~mem4_17|))) (< v_ArrVal_387 (+ (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset) 1)) (< |v_func_to_recursive_line_26_to_34_0_#t~mem5_17| .cse1))))))) is different from false [2024-11-09 05:57:50,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:50,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057986619] [2024-11-09 05:57:50,223 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:57:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880330327] [2024-11-09 05:57:50,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880330327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:57:50,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1827401803] [2024-11-09 05:57:50,254 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:57:50,254 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:57:50,260 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:57:50,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:57:50,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-09 05:57:50,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605997669] [2024-11-09 05:57:50,269 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:57:50,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:57:50,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:50,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:57:50,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=190, Unknown=8, NotChecked=90, Total=342 [2024-11-09 05:57:50,271 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:50,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:50,920 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2024-11-09 05:57:50,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 05:57:50,921 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 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 27 [2024-11-09 05:57:50,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:50,923 INFO L225 Difference]: With dead ends: 121 [2024-11-09 05:57:50,923 INFO L226 Difference]: Without dead ends: 120 [2024-11-09 05:57:50,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=330, Unknown=8, NotChecked=120, Total=552 [2024-11-09 05:57:50,924 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 86 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:50,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 318 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 05:57:50,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-09 05:57:50,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2024-11-09 05:57:50,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 92 states have internal predecessors, (101), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-09 05:57:50,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-11-09 05:57:50,941 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2024-11-09 05:57:50,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:50,942 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-11-09 05:57:50,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:50,942 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-11-09 05:57:50,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 05:57:50,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:50,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:50,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 05:57:51,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-09 05:57:51,145 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:51,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1541984736, now seen corresponding path program 1 times [2024-11-09 05:57:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617955727] [2024-11-09 05:57:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:51,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:51,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:51,458 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617955727] [2024-11-09 05:57:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617955727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:51,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:51,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:57:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324374444] [2024-11-09 05:57:51,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:51,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:57:51,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:57:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:51,461 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:51,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:51,797 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-09 05:57:51,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 05:57:51,798 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2024-11-09 05:57:51,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:51,799 INFO L225 Difference]: With dead ends: 108 [2024-11-09 05:57:51,800 INFO L226 Difference]: Without dead ends: 107 [2024-11-09 05:57:51,800 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 05:57:51,801 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 38 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:51,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 123 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 05:57:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-09 05:57:51,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-09 05:57:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 93 states have internal predecessors, (102), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-09 05:57:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-11-09 05:57:51,812 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 27 [2024-11-09 05:57:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:51,813 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-09 05:57:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 8 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-11-09 05:57:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:57:51,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:51,814 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:51,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 05:57:51,815 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting func_to_recursive_line_26_to_34_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:51,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:51,815 INFO L85 PathProgramCache]: Analyzing trace with hash -278544311, now seen corresponding path program 1 times [2024-11-09 05:57:51,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:51,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471831045] [2024-11-09 05:57:51,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:51,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:51,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:57:51,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [544375202] [2024-11-09 05:57:51,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:51,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:51,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:51,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:57:51,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 05:57:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:51,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 05:57:51,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:57:52,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-09 05:57:52,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-11-09 05:57:52,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:57:52,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2024-11-09 05:57:52,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:52,166 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:57:52,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-09 05:57:52,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:57:52,250 INFO L349 Elim1Store]: treesize reduction 28, result has 37.8 percent of original size [2024-11-09 05:57:52,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 44 [2024-11-09 05:57:52,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:57:52,323 INFO L349 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2024-11-09 05:57:52,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 48 [2024-11-09 05:57:52,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:57:52,366 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 42 treesize of output 40 [2024-11-09 05:57:52,405 INFO L349 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2024-11-09 05:57:52,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 36 [2024-11-09 05:57:52,423 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-09 05:57:52,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 29 [2024-11-09 05:57:52,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:57:52,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:57:52,480 INFO L349 Elim1Store]: treesize reduction 28, result has 37.8 percent of original size [2024-11-09 05:57:52,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 44 [2024-11-09 05:57:52,510 INFO L349 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2024-11-09 05:57:52,510 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 3 case distinctions, treesize of input 48 treesize of output 32 [2024-11-09 05:57:52,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 05:57:52,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:57:52,548 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 103 treesize of output 101 [2024-11-09 05:57:52,618 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 05:57:52,619 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 27 [2024-11-09 05:57:52,640 INFO L349 Elim1Store]: treesize reduction 19, result has 13.6 percent of original size [2024-11-09 05:57:52,640 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 1 case distinctions, treesize of input 27 treesize of output 18 [2024-11-09 05:57:52,652 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:52,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 05:57:52,686 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 05:57:52,687 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 32 [2024-11-09 05:57:52,718 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-09 05:57:52,719 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 1 case distinctions, treesize of input 32 treesize of output 22 [2024-11-09 05:57:52,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:57:52,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 05:57:52,753 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:57:52,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2024-11-09 05:57:52,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:57:53,035 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 11 [2024-11-09 05:57:53,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 05:57:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:53,130 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:57:55,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (|v_func_to_recursive_line_26_to_34_0_#t~mem5_19| Int)) (let ((.cse0 (select (select (store (let ((.cse1 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_457))) (store .cse1 c_func_to_recursive_line_26_to_34_0_~y.base (let ((.cse2 (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.base))) (store .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset (+ (select .cse2 c_func_to_recursive_line_26_to_34_0_~y.offset) 1))))) c_func_to_recursive_line_26_to_34_0_~x.base v_ArrVal_460) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (< (* |v_func_to_recursive_line_26_to_34_0_#t~mem5_19| .cse0) 9223372036854775808) (< .cse0 |v_func_to_recursive_line_26_to_34_0_#t~mem5_19|)))) is different from false [2024-11-09 05:57:55,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471831045] [2024-11-09 05:57:55,964 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:57:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544375202] [2024-11-09 05:57:55,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544375202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:57:55,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843857455] [2024-11-09 05:57:55,967 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:57:55,967 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:57:55,968 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:57:55,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:57:55,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-09 05:57:55,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418861855] [2024-11-09 05:57:55,970 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:57:55,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 05:57:55,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:55,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 05:57:55,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=5, NotChecked=28, Total=272 [2024-11-09 05:57:55,972 INFO L87 Difference]: Start difference. First operand 106 states and 118 transitions. Second operand has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:56,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:56,669 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2024-11-09 05:57:56,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 05:57:56,670 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 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 28 [2024-11-09 05:57:56,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:56,673 INFO L225 Difference]: With dead ends: 119 [2024-11-09 05:57:56,674 INFO L226 Difference]: Without dead ends: 118 [2024-11-09 05:57:56,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=78, Invalid=301, Unknown=5, NotChecked=36, Total=420 [2024-11-09 05:57:56,676 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:56,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 251 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 05:57:56,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-09 05:57:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-11-09 05:57:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 73 states have (on average 1.3835616438356164) internal successors, (101), 93 states have internal predecessors, (101), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (10), 7 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-09 05:57:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-11-09 05:57:56,692 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 28 [2024-11-09 05:57:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:56,692 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-11-09 05:57:56,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:57:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-11-09 05:57:56,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 05:57:56,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:56,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:56,724 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 05:57:56,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:56,899 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:56,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -556886510, now seen corresponding path program 1 times [2024-11-09 05:57:56,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:56,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139502079] [2024-11-09 05:57:56,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:57,295 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:57,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139502079] [2024-11-09 05:57:57,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139502079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 05:57:57,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 05:57:57,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 05:57:57,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445933214] [2024-11-09 05:57:57,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 05:57:57,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 05:57:57,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:57:57,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 05:57:57,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:57,299 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:57,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:57:57,459 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-09 05:57:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 05:57:57,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-09 05:57:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:57:57,463 INFO L225 Difference]: With dead ends: 108 [2024-11-09 05:57:57,463 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 05:57:57,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 05:57:57,464 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 29 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:57:57,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 05:57:57,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 05:57:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-09 05:57:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.421875) internal successors, (91), 84 states have internal predecessors, (91), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2024-11-09 05:57:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-09 05:57:57,479 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 28 [2024-11-09 05:57:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:57:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-09 05:57:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 4.0) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:57:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-09 05:57:57,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 05:57:57,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:57:57,481 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:57:57,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 05:57:57,482 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting func_to_recursive_line_26_to_34_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:57:57,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:57:57,483 INFO L85 PathProgramCache]: Analyzing trace with hash -44938984, now seen corresponding path program 1 times [2024-11-09 05:57:57,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:57:57,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833055313] [2024-11-09 05:57:57,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:57,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:57:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:58,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:57:58,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:57:58,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833055313] [2024-11-09 05:57:58,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833055313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:57:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771625628] [2024-11-09 05:57:58,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:57:58,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:57:58,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:57:59,000 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:57:59,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 05:57:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:57:59,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 05:57:59,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:57:59,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:59,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:59,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:57:59,515 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-11-09 05:57:59,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2024-11-09 05:57:59,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-09 05:57:59,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2024-11-09 05:57:59,678 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:57:59,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 57 [2024-11-09 05:58:00,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 49 treesize of output 58 [2024-11-09 05:58:00,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 49 treesize of output 58 [2024-11-09 05:58:00,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 49 treesize of output 58 [2024-11-09 05:58:00,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:00,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:00,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:00,467 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:00,498 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:00,508 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:00,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:00,529 INFO L224 Elim1Store]: Index analysis took 106 ms [2024-11-09 05:58:00,629 INFO L349 Elim1Store]: treesize reduction 81, result has 17.3 percent of original size [2024-11-09 05:58:00,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 278 treesize of output 254 [2024-11-09 05:58:01,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,088 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,094 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,119 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,129 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,130 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 275 treesize of output 235 [2024-11-09 05:58:01,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,595 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,609 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,616 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,617 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:01,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 76 [2024-11-09 05:58:01,644 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-09 05:58:01,645 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 2 case distinctions, treesize of input 29 treesize of output 7 [2024-11-09 05:58:01,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:01,753 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-11-09 05:58:01,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 267 treesize of output 234 [2024-11-09 05:58:02,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:02,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:02,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:02,182 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 05:58:02,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 30 [2024-11-09 05:58:02,193 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 15 treesize of output 11 [2024-11-09 05:58:02,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-09 05:58:02,982 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 43 treesize of output 23 [2024-11-09 05:58:03,074 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 47 treesize of output 23 [2024-11-09 05:58:03,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-09 05:58:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:03,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:58:03,690 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_532 Int) (v_ArrVal_530 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_530))) (let ((.cse0 (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.base))) (or (< v_ArrVal_532 (+ (select .cse0 c_func_to_recursive_line_26_to_34_0_~y.offset) 1)) (< 0 (+ v_ArrVal_532 (select (select (store .cse1 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse0 c_func_to_recursive_line_26_to_34_0_~y.offset v_ArrVal_532)) c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset) 4611686018427387905)))))) is different from false [2024-11-09 05:58:03,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [771625628] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1756383147] [2024-11-09 05:58:03,766 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:58:03,766 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:58:03,767 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:58:03,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:58:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2024-11-09 05:58:03,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336025938] [2024-11-09 05:58:03,768 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:58:03,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:58:03,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:58:03,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:58:03,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=713, Unknown=1, NotChecked=54, Total=870 [2024-11-09 05:58:03,771 INFO L87 Difference]: Start difference. First operand 96 states and 106 transitions. Second operand has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:58:06,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-09 05:58:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:58:06,951 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2024-11-09 05:58:06,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:58:06,952 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2024-11-09 05:58:06,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:58:06,954 INFO L225 Difference]: With dead ends: 98 [2024-11-09 05:58:06,954 INFO L226 Difference]: Without dead ends: 95 [2024-11-09 05:58:06,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=246, Invalid=1479, Unknown=1, NotChecked=80, Total=1806 [2024-11-09 05:58:06,956 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 203 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 653 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:58:06,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 372 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-09 05:58:06,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-09 05:58:06,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-09 05:58:06,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.353846153846154) internal successors, (88), 82 states have internal predecessors, (88), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-09 05:58:06,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-09 05:58:06,971 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 29 [2024-11-09 05:58:06,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:58:06,971 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-09 05:58:06,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 19 states have internal predecessors, (49), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:58:06,972 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-09 05:58:06,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 05:58:06,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:58:06,972 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:58:07,000 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 05:58:07,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:58:07,174 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting func_to_recursive_line_26_to_34_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:58:07,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:58:07,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1393108437, now seen corresponding path program 1 times [2024-11-09 05:58:07,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:58:07,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746651572] [2024-11-09 05:58:07,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:07,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:58:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:08,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:08,489 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:58:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746651572] [2024-11-09 05:58:08,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746651572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:08,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767196638] [2024-11-09 05:58:08,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:08,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:58:08,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:58:08,492 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:58:08,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 05:58:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:08,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 05:58:08,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:58:08,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 55 [2024-11-09 05:58:08,724 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 05:58:08,724 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 1 case distinctions, treesize of input 41 treesize of output 38 [2024-11-09 05:58:08,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:08,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:08,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:08,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:08,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2024-11-09 05:58:08,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 05:58:08,765 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:58:08,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 86 [2024-11-09 05:58:08,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 05:58:09,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-11-09 05:58:09,458 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 30 treesize of output 14 [2024-11-09 05:58:09,531 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 47 treesize of output 23 [2024-11-09 05:58:09,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-09 05:58:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:09,777 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:58:10,032 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int)) (v_ArrVal_589 Int)) (let ((.cse0 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_588))) (let ((.cse1 (select .cse0 c_func_to_recursive_line_26_to_34_0_~y.base))) (or (< (+ v_ArrVal_589 (select (select (store .cse0 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset v_ArrVal_589)) c_func_to_recursive_line_26_to_34_0_~x.base) c_func_to_recursive_line_26_to_34_0_~x.offset)) 4611686018427387904) (< (+ 1 (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset)) v_ArrVal_589))))) is different from false [2024-11-09 05:58:10,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767196638] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:10,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [651516503] [2024-11-09 05:58:10,091 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:58:10,091 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:58:10,092 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:58:10,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:58:10,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-09 05:58:10,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449464924] [2024-11-09 05:58:10,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:58:10,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 05:58:10,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:58:10,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 05:58:10,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=644, Unknown=1, NotChecked=52, Total=812 [2024-11-09 05:58:10,095 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand has 23 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:58:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:58:11,337 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-09 05:58:11,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 05:58:11,338 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-09 05:58:11,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:58:11,339 INFO L225 Difference]: With dead ends: 104 [2024-11-09 05:58:11,339 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 05:58:11,340 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=281, Invalid=1282, Unknown=1, NotChecked=76, Total=1640 [2024-11-09 05:58:11,341 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 116 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 05:58:11,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 320 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 05:58:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 05:58:11,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-09 05:58:11,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 82 states have internal predecessors, (87), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-09 05:58:11,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-09 05:58:11,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 30 [2024-11-09 05:58:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:58:11,362 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-09 05:58:11,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:58:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-09 05:58:11,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 05:58:11,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:58:11,363 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:58:11,385 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 05:58:11,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:58:11,564 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting func_to_recursive_line_26_to_34_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:58:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:58:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash -236688518, now seen corresponding path program 1 times [2024-11-09 05:58:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:58:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191001537] [2024-11-09 05:58:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:58:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-09 05:58:11,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [198031972] [2024-11-09 05:58:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:11,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:58:11,622 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:58:11,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:58:11,631 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 05:58:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:11,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 05:58:11,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:58:11,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:11,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:11,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:11,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:12,084 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-11-09 05:58:12,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 130 treesize of output 333 [2024-11-09 05:58:12,139 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:58:12,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 69 [2024-11-09 05:58:12,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-09 05:58:12,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2024-11-09 05:58:12,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-11-09 05:58:12,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-11-09 05:58:12,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 33 treesize of output 50 [2024-11-09 05:58:15,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:15,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:15,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:15,522 INFO L349 Elim1Store]: treesize reduction 111, result has 24.5 percent of original size [2024-11-09 05:58:15,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 3192 treesize of output 3199 [2024-11-09 05:58:15,791 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-09 05:58:15,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 32 [2024-11-09 05:58:15,842 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 [2024-11-09 05:58:16,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:16,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:16,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:16,933 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-09 05:58:16,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1901 treesize of output 1648 [2024-11-09 05:58:17,178 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 30 treesize of output 14 [2024-11-09 05:58:17,238 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 41 treesize of output 21 [2024-11-09 05:58:17,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2024-11-09 05:58:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:17,487 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:58:18,949 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (|v_func_to_recursive_line_26_to_34_0_#t~mem4_25| Int) (|v_func_to_recursive_line_26_to_34_0_#t~mem5_25| Int) (v_ArrVal_648 Int) (v_ArrVal_646 Int)) (let ((.cse4 (store |c_#memory_int| c_func_to_recursive_line_26_to_34_0_~c.base v_ArrVal_644))) (let ((.cse1 (select .cse4 c_func_to_recursive_line_26_to_34_0_~y.base))) (let ((.cse3 (store .cse4 c_func_to_recursive_line_26_to_34_0_~y.base (store .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset v_ArrVal_646)))) (let ((.cse2 (select .cse3 c_func_to_recursive_line_26_to_34_0_~x.base))) (let ((.cse0 (select (select (store .cse3 c_func_to_recursive_line_26_to_34_0_~x.base (store .cse2 c_func_to_recursive_line_26_to_34_0_~x.offset v_ArrVal_648)) c_func_to_recursive_line_26_to_34_0_~y.base) c_func_to_recursive_line_26_to_34_0_~y.offset))) (or (< |v_func_to_recursive_line_26_to_34_0_#t~mem4_25| .cse0) (< v_ArrVal_646 (+ (select .cse1 c_func_to_recursive_line_26_to_34_0_~y.offset) 1)) (< |v_func_to_recursive_line_26_to_34_0_#t~mem5_25| .cse0) (< (* v_ArrVal_648 2) (+ 9223372036854775809 (* |v_func_to_recursive_line_26_to_34_0_#t~mem5_25| |v_func_to_recursive_line_26_to_34_0_#t~mem4_25|))) (< (+ v_ArrVal_646 (select .cse2 c_func_to_recursive_line_26_to_34_0_~x.offset)) v_ArrVal_648)))))))) is different from false [2024-11-09 05:58:19,218 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:58:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191001537] [2024-11-09 05:58:19,219 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-09 05:58:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198031972] [2024-11-09 05:58:19,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198031972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:19,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [935362535] [2024-11-09 05:58:19,221 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:58:19,222 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:58:19,222 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:58:19,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-09 05:58:19,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-09 05:58:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840838826] [2024-11-09 05:58:19,224 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-09 05:58:19,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 05:58:19,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:58:19,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 05:58:19,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=259, Unknown=3, NotChecked=32, Total=342 [2024-11-09 05:58:19,226 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 12 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:58:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:58:20,930 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-09 05:58:20,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:58:20,930 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 3 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 31 [2024-11-09 05:58:20,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:58:20,932 INFO L225 Difference]: With dead ends: 103 [2024-11-09 05:58:20,932 INFO L226 Difference]: Without dead ends: 102 [2024-11-09 05:58:20,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=82, Invalid=381, Unknown=3, NotChecked=40, Total=506 [2024-11-09 05:58:20,933 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 05:58:20,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 260 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 5 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 05:58:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-09 05:58:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2024-11-09 05:58:20,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.323076923076923) internal successors, (86), 82 states have internal predecessors, (86), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-09 05:58:20,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-09 05:58:20,947 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 31 [2024-11-09 05:58:20,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:58:20,948 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-09 05:58:20,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.7) internal successors, (27), 9 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 05:58:20,948 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-09 05:58:20,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 05:58:20,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:58:20,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:58:20,974 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 05:58:21,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 05:58:21,150 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting func_to_recursive_line_26_to_34_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:58:21,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:58:21,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1252590605, now seen corresponding path program 1 times [2024-11-09 05:58:21,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:58:21,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341459249] [2024-11-09 05:58:21,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:58:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:22,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:22,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 05:58:22,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341459249] [2024-11-09 05:58:22,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341459249] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:22,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919687972] [2024-11-09 05:58:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:22,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 05:58:22,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 05:58:22,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 05:58:22,385 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 05:58:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 05:58:22,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-09 05:58:22,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 05:58:22,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:22,770 INFO L349 Elim1Store]: treesize reduction 78, result has 36.6 percent of original size [2024-11-09 05:58:22,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 102 [2024-11-09 05:58:22,813 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 05:58:22,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 189 treesize of output 183 [2024-11-09 05:58:22,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:22,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 35 [2024-11-09 05:58:22,910 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-09 05:58:22,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:58:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 05:58:22,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:22,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 46 [2024-11-09 05:58:22,996 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 [2024-11-09 05:58:23,013 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 05:58:23,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2024-11-09 05:58:23,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:23,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:23,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:23,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 26 [2024-11-09 05:58:23,068 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:58:23,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:23,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:23,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 05:58:23,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 26 [2024-11-09 05:58:23,108 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 05:58:23,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2024-11-09 05:58:24,151 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 05:58:24,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 28 [2024-11-09 05:58:24,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 33 [2024-11-09 05:58:24,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-09 05:58:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 05:58:25,034 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 05:58:29,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919687972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 05:58:29,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2050732676] [2024-11-09 05:58:29,496 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-09 05:58:29,496 INFO L166 IcfgInterpreter]: Building call graph [2024-11-09 05:58:29,497 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 05:58:29,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 05:58:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2024-11-09 05:58:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635155167] [2024-11-09 05:58:29,498 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 05:58:29,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 05:58:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 05:58:29,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 05:58:29,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=824, Unknown=1, NotChecked=0, Total=930 [2024-11-09 05:58:29,500 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 24 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:58:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 05:58:31,416 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-09 05:58:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 05:58:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2024-11-09 05:58:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 05:58:31,417 INFO L225 Difference]: With dead ends: 102 [2024-11-09 05:58:31,418 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 05:58:31,418 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=200, Invalid=1359, Unknown=1, NotChecked=0, Total=1560 [2024-11-09 05:58:31,419 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 125 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 05:58:31,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 463 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 05:58:31,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 05:58:31,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-11-09 05:58:31,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 82 states have internal predecessors, (85), 6 states have call successors, (6), 5 states have call predecessors, (6), 7 states have return successors, (11), 7 states have call predecessors, (11), 6 states have call successors, (11) [2024-11-09 05:58:31,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-09 05:58:31,435 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 32 [2024-11-09 05:58:31,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 05:58:31,435 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-09 05:58:31,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 19 states have (on average 2.9473684210526314) internal successors, (56), 20 states have internal predecessors, (56), 6 states have call successors, (6), 6 states have call predecessors, (6), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 05:58:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-09 05:58:31,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 05:58:31,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 05:58:31,437 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 05:58:31,463 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 05:58:31,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ab681b66-367b-446b-9647-a2c5dce8a5ce/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 05:58:31,637 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting func_to_recursive_line_26_to_34_0Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2024-11-09 05:58:31,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 05:58:31,638 INFO L85 PathProgramCache]: Analyzing trace with hash 175603164, now seen corresponding path program 1 times [2024-11-09 05:58:31,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 05:58:31,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811983748] [2024-11-09 05:58:31,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 05:58:31,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 05:58:31,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat