./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 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/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_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E --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.3.0-dev-826ab2b [2024-11-14 05:30:46,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 05:30:46,683 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-Overflow-32bit-Taipan_Default.epf [2024-11-14 05:30:46,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 05:30:46,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 05:30:46,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 05:30:46,720 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 05:30:46,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 05:30:46,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 05:30:46,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 05:30:46,721 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 05:30:46,722 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 05:30:46,722 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 05:30:46,722 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 05:30:46,722 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 05:30:46,722 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 05:30:46,723 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 05:30:46,723 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 05:30:46,723 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 05:30:46,723 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 05:30:46,723 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 05:30:46,724 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 05:30:46,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 05:30:46,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 05:30:46,725 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 05:30:46,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 05:30:46,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:30:46,727 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 05:30:46,727 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E 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-14 05:30:47,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 05:30:47,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 05:30:47,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 05:30:47,141 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 05:30:47,141 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 05:30:47,143 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c Unable to find full path for "g++" [2024-11-14 05:30:49,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 05:30:49,963 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 05:30:49,964 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/sv-benchmarks/c/recursified_nla-digbench/recursified_ps2-ll.c [2024-11-14 05:30:49,973 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/data/7dd784e3e/e03974b2d7044f6eab61e40b7d04d775/FLAG9a5334e3b [2024-11-14 05:30:49,996 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/data/7dd784e3e/e03974b2d7044f6eab61e40b7d04d775 [2024-11-14 05:30:50,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 05:30:50,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 05:30:50,004 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 05:30:50,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 05:30:50,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 05:30:50,011 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:49" (1/1) ... [2024-11-14 05:30:50,013 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4daf2be5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50, skipping insertion in model container [2024-11-14 05:30:50,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:30:49" (1/1) ... [2024-11-14 05:30:50,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 05:30:50,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:30:50,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 05:30:50,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 05:30:50,332 INFO L204 MainTranslator]: Completed translation [2024-11-14 05:30:50,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50 WrapperNode [2024-11-14 05:30:50,334 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 05:30:50,336 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 05:30:50,336 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 05:30:50,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 05:30:50,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,394 INFO L138 Inliner]: procedures = 16, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2024-11-14 05:30:50,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 05:30:50,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 05:30:50,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 05:30:50,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 05:30:50,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,431 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,433 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,436 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 05:30:50,444 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 05:30:50,444 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 05:30:50,444 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 05:30:50,445 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (1/1) ... [2024-11-14 05:30:50,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 05:30:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:50,497 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 05:30:50,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 05:30:50,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 05:30:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_26_to_34_0 [2024-11-14 05:30:50,537 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_26_to_34_0 [2024-11-14 05:30:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-14 05:30:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-14 05:30:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-14 05:30:50,666 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 05:30:50,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 05:30:51,078 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-14 05:30:51,078 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 05:30:51,121 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 05:30:51,122 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-14 05:30:51,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:51 BoogieIcfgContainer [2024-11-14 05:30:51,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 05:30:51,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 05:30:51,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 05:30:51,132 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 05:30:51,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:30:49" (1/3) ... [2024-11-14 05:30:51,133 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b742a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:51, skipping insertion in model container [2024-11-14 05:30:51,133 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:30:50" (2/3) ... [2024-11-14 05:30:51,134 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b742a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:30:51, skipping insertion in model container [2024-11-14 05:30:51,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:30:51" (3/3) ... [2024-11-14 05:30:51,135 INFO L112 eAbstractionObserver]: Analyzing ICFG recursified_ps2-ll.c [2024-11-14 05:30:51,156 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 05:30:51,158 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_ps2-ll.c that has 3 procedures, 60 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2024-11-14 05:30:51,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 05:30:51,242 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;@4e02db2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 05:30:51,242 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-14 05:30:51,247 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-14 05:30:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-14 05:30:51,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:51,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-14 05:30:51,258 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-14 05:30:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:51,264 INFO L85 PathProgramCache]: Analyzing trace with hash 114185027, now seen corresponding path program 1 times [2024-11-14 05:30:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:51,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651074456] [2024-11-14 05:30:51,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:51,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:51,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:30:51,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723270124] [2024-11-14 05:30:51,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:51,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:51,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:51,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:51,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-14 05:30:51,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:51,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-14 05:30:51,698 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:30:51,905 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-14 05:30:51,906 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-14 05:30:51,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:30:51,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:30:51,956 INFO L349 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2024-11-14 05:30:51,956 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-14 05:30:51,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:30:52,005 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-14 05:30:52,260 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-14 05:30:52,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:30:52,262 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:52,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651074456] [2024-11-14 05:30:52,263 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:30:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723270124] [2024-11-14 05:30:52,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723270124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:52,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:52,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028664927] [2024-11-14 05:30:52,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:52,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:30:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:30:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:30:52,306 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-14 05:30:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:52,653 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2024-11-14 05:30:52,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:30:52,657 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-14 05:30:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:52,667 INFO L225 Difference]: With dead ends: 124 [2024-11-14 05:30:52,667 INFO L226 Difference]: Without dead ends: 95 [2024-11-14 05:30:52,671 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-14 05:30:52,677 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.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:52,679 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.3s Time] [2024-11-14 05:30:52,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-14 05:30:52,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2024-11-14 05:30:52,731 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-14 05:30:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2024-11-14 05:30:52,743 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 5 [2024-11-14 05:30:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:52,746 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2024-11-14 05:30:52,746 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-14 05:30:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2024-11-14 05:30:52,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-14 05:30:52,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:52,748 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:52,767 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-14 05:30:52,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-14 05:30:52,954 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-14 05:30:52,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:52,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1937336731, now seen corresponding path program 1 times [2024-11-14 05:30:52,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:52,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499578704] [2024-11-14 05:30:52,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:52,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:53,648 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-14 05:30:53,648 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:53,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499578704] [2024-11-14 05:30:53,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499578704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:53,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:53,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:53,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648778877] [2024-11-14 05:30:53,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:53,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:30:53,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:53,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:30:53,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:30:53,651 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-14 05:30:54,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:54,001 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-14 05:30:54,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:30:54,002 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-14 05:30:54,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:54,003 INFO L225 Difference]: With dead ends: 87 [2024-11-14 05:30:54,005 INFO L226 Difference]: Without dead ends: 85 [2024-11-14 05:30:54,005 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-14 05:30:54,006 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-14 05:30:54,007 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-14 05:30:54,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-14 05:30:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 72. [2024-11-14 05:30:54,019 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-14 05:30:54,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-14 05:30:54,020 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 7 [2024-11-14 05:30:54,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:54,020 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-14 05:30:54,021 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-14 05:30:54,021 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-14 05:30:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-14 05:30:54,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:54,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:54,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 05:30:54,022 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-14 05:30:54,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2059757177, now seen corresponding path program 1 times [2024-11-14 05:30:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107032731] [2024-11-14 05:30:54,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:54,424 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-14 05:30:54,424 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107032731] [2024-11-14 05:30:54,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107032731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:54,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:54,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:30:54,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68119563] [2024-11-14 05:30:54,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:54,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:30:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:54,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:30:54,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:54,427 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-14 05:30:54,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:54,771 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-14 05:30:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:30:54,772 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-14 05:30:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:54,773 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:30:54,774 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:30:54,774 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-14 05:30:54,775 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-14 05:30:54,775 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-14 05:30:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:30:54,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2024-11-14 05:30:54,795 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-14 05:30:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-11-14 05:30:54,798 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 9 [2024-11-14 05:30:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:54,798 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-11-14 05:30:54,798 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-14 05:30:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-11-14 05:30:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-14 05:30:54,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:54,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:54,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 05:30:54,800 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-14 05:30:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 572037024, now seen corresponding path program 1 times [2024-11-14 05:30:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664884142] [2024-11-14 05:30:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:55,384 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-14 05:30:55,384 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:55,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664884142] [2024-11-14 05:30:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664884142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:55,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24151945] [2024-11-14 05:30:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:30:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:30:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:30:55,386 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-14 05:30:55,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:55,939 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-14 05:30:55,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:30:55,939 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-14 05:30:55,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:55,940 INFO L225 Difference]: With dead ends: 84 [2024-11-14 05:30:55,940 INFO L226 Difference]: Without dead ends: 83 [2024-11-14 05:30:55,941 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-14 05:30:55,942 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 42 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-14 05:30:55,942 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-14 05:30:55,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-14 05:30:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2024-11-14 05:30:55,954 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-14 05:30:55,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-11-14 05:30:55,956 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 10 [2024-11-14 05:30:55,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:55,956 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-11-14 05:30:55,956 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-14 05:30:55,956 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-11-14 05:30:55,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-14 05:30:55,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:55,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:55,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 05:30:55,960 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-14 05:30:55,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:55,961 INFO L85 PathProgramCache]: Analyzing trace with hash 553278633, now seen corresponding path program 1 times [2024-11-14 05:30:55,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:55,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928998469] [2024-11-14 05:30:55,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:55,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:56,560 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-14 05:30:56,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:56,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928998469] [2024-11-14 05:30:56,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928998469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:56,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:56,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 05:30:56,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595611144] [2024-11-14 05:30:56,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:56,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:30:56,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:56,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:30:56,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:56,564 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-14 05:30:56,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:56,946 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-14 05:30:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:30:56,947 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-14 05:30:56,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:56,948 INFO L225 Difference]: With dead ends: 91 [2024-11-14 05:30:56,948 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:30:56,948 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-14 05:30:56,949 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 43 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-14 05:30:56,950 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-14 05:30:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:30:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2024-11-14 05:30:56,970 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-14 05:30:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2024-11-14 05:30:56,974 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 11 [2024-11-14 05:30:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2024-11-14 05:30:56,974 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-14 05:30:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2024-11-14 05:30:56,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-14 05:30:56,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:56,975 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 05:30:56,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 05:30:56,975 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-14 05:30:56,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -28231486, now seen corresponding path program 1 times [2024-11-14 05:30:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:56,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5229900] [2024-11-14 05:30:56,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:56,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:57,616 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-14 05:30:57,616 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:57,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5229900] [2024-11-14 05:30:57,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5229900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:57,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:57,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:30:57,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231874967] [2024-11-14 05:30:57,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:57,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 05:30:57,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:57,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 05:30:57,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 05:30:57,618 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-14 05:30:57,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:57,931 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-14 05:30:57,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:30:57,932 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-14 05:30:57,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:57,933 INFO L225 Difference]: With dead ends: 82 [2024-11-14 05:30:57,935 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 05:30:57,935 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-14 05:30:57,936 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.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:30:57,936 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.3s Time] [2024-11-14 05:30:57,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 05:30:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2024-11-14 05:30:57,946 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-14 05:30:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-11-14 05:30:57,948 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 12 [2024-11-14 05:30:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:57,948 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-11-14 05:30:57,948 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-14 05:30:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-11-14 05:30:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 05:30:57,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:57,949 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-14 05:30:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 05:30:57,950 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-14 05:30:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2086856296, now seen corresponding path program 1 times [2024-11-14 05:30:57,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:57,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381809615] [2024-11-14 05:30:57,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:57,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:58,245 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-14 05:30:58,245 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:58,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381809615] [2024-11-14 05:30:58,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381809615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:58,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:58,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:30:58,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254460645] [2024-11-14 05:30:58,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:58,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:30:58,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:58,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:30:58,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:58,248 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-14 05:30:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:58,435 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2024-11-14 05:30:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:30:58,436 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-14 05:30:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:58,437 INFO L225 Difference]: With dead ends: 93 [2024-11-14 05:30:58,437 INFO L226 Difference]: Without dead ends: 92 [2024-11-14 05:30:58,438 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-14 05:30:58,442 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-14 05:30:58,442 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-14 05:30:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-14 05:30:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2024-11-14 05:30:58,456 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-14 05:30:58,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-11-14 05:30:58,457 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 18 [2024-11-14 05:30:58,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:58,457 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-11-14 05:30:58,457 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-14 05:30:58,458 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-11-14 05:30:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-14 05:30:58,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:58,458 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-14 05:30:58,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 05:30:58,458 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-14 05:30:58,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 268035821, now seen corresponding path program 1 times [2024-11-14 05:30:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298093591] [2024-11-14 05:30:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:58,705 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-14 05:30:58,705 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:58,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298093591] [2024-11-14 05:30:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298093591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:30:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459229673] [2024-11-14 05:30:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:30:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:58,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:30:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:58,707 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-14 05:30:58,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:58,895 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2024-11-14 05:30:58,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:30:58,896 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-14 05:30:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:58,897 INFO L225 Difference]: With dead ends: 92 [2024-11-14 05:30:58,897 INFO L226 Difference]: Without dead ends: 91 [2024-11-14 05:30:58,897 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-14 05:30:58,898 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-14 05:30:58,898 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-14 05:30:58,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-14 05:30:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2024-11-14 05:30:58,914 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-14 05:30:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-11-14 05:30:58,915 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 19 [2024-11-14 05:30:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-11-14 05:30:58,919 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-14 05:30:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-11-14 05:30:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 05:30:58,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:58,920 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-14 05:30:58,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 05:30:58,920 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-14 05:30:58,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:58,921 INFO L85 PathProgramCache]: Analyzing trace with hash -280824054, now seen corresponding path program 1 times [2024-11-14 05:30:58,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:58,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862955534] [2024-11-14 05:30:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:58,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:30:59,560 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-14 05:30:59,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:30:59,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862955534] [2024-11-14 05:30:59,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862955534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:30:59,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:30:59,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:30:59,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949038112] [2024-11-14 05:30:59,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:30:59,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:30:59,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:30:59,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:30:59,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:30:59,562 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-14 05:30:59,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:30:59,845 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-14 05:30:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:30:59,847 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-14 05:30:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:30:59,848 INFO L225 Difference]: With dead ends: 91 [2024-11-14 05:30:59,848 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:30:59,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:30:59,850 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 05:30:59,851 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-14 05:30:59,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:30:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2024-11-14 05:30:59,866 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-14 05:30:59,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2024-11-14 05:30:59,867 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 20 [2024-11-14 05:30:59,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:30:59,867 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2024-11-14 05:30:59,867 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-14 05:30:59,867 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2024-11-14 05:30:59,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:30:59,871 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:30:59,871 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-14 05:30:59,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 05:30:59,871 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-14 05:30:59,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:30:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -116063398, now seen corresponding path program 1 times [2024-11-14 05:30:59,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:30:59,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906666125] [2024-11-14 05:30:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:59,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:30:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:30:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255598628] [2024-11-14 05:30:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:30:59,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:30:59,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:30:59,913 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:30:59,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-14 05:31:00,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:00,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-14 05:31:00,056 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:00,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:00,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:00,182 INFO L349 Elim1Store]: treesize reduction 92, result has 25.2 percent of original size [2024-11-14 05:31:00,182 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-14 05:31:00,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:00,217 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-14 05:31:00,248 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-14 05:31:00,377 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-14 05:31:00,401 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-14 05:31:00,423 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-14 05:31:00,579 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-14 05:31:00,589 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-14 05:31:00,659 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-14 05:31:00,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 05:31:00,659 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:00,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906666125] [2024-11-14 05:31:00,660 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:31:00,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255598628] [2024-11-14 05:31:00,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255598628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:00,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:00,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 05:31:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117625891] [2024-11-14 05:31:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:00,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 05:31:00,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 05:31:00,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 05:31:00,661 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-14 05:31:00,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:00,802 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2024-11-14 05:31:00,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:00,803 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-14 05:31:00,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:00,805 INFO L225 Difference]: With dead ends: 92 [2024-11-14 05:31:00,805 INFO L226 Difference]: Without dead ends: 90 [2024-11-14 05:31:00,805 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-14 05:31:00,806 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-14 05:31:00,807 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-14 05:31:00,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-14 05:31:00,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 80. [2024-11-14 05:31:00,815 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-14 05:31:00,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-14 05:31:00,819 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 21 [2024-11-14 05:31:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:00,819 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-14 05:31:00,820 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-14 05:31:00,820 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-14 05:31:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-14 05:31:00,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:00,823 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-14 05:31:00,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-14 05:31:01,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-14 05:31:01,025 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-14 05:31:01,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash -115610993, now seen corresponding path program 1 times [2024-11-14 05:31:01,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601478947] [2024-11-14 05:31:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:01,869 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-14 05:31:01,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601478947] [2024-11-14 05:31:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601478947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:01,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-14 05:31:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662197054] [2024-11-14 05:31:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:01,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-14 05:31:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:01,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-14 05:31:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-14 05:31:01,872 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-14 05:31:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:02,226 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-11-14 05:31:02,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:31:02,228 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-14 05:31:02,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:02,229 INFO L225 Difference]: With dead ends: 90 [2024-11-14 05:31:02,230 INFO L226 Difference]: Without dead ends: 89 [2024-11-14 05:31:02,231 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-14 05:31:02,232 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-14 05:31:02,232 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-14 05:31:02,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-14 05:31:02,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2024-11-14 05:31:02,244 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-14 05:31:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-14 05:31:02,245 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 21 [2024-11-14 05:31:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:02,245 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-14 05:31:02,246 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-14 05:31:02,249 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-14 05:31:02,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-14 05:31:02,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:02,249 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-14 05:31:02,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-14 05:31:02,250 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-14 05:31:02,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash 711026604, now seen corresponding path program 1 times [2024-11-14 05:31:02,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:02,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38786873] [2024-11-14 05:31:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:02,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:02,716 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-14 05:31:02,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38786873] [2024-11-14 05:31:02,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38786873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:02,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:31:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097138231] [2024-11-14 05:31:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:02,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:02,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:02,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:02,718 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-14 05:31:02,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:02,962 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2024-11-14 05:31:02,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 05:31:02,963 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-14 05:31:02,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:02,965 INFO L225 Difference]: With dead ends: 85 [2024-11-14 05:31:02,965 INFO L226 Difference]: Without dead ends: 84 [2024-11-14 05:31:02,965 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-14 05:31:02,966 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-14 05:31:02,966 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-14 05:31:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-14 05:31:02,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-14 05:31:02,977 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-14 05:31:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-14 05:31:02,978 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 22 [2024-11-14 05:31:02,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:02,978 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-14 05:31:02,978 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-14 05:31:02,979 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-14 05:31:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:31:02,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:02,980 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-14 05:31:02,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-14 05:31:02,981 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-14 05:31:02,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash 132225436, now seen corresponding path program 1 times [2024-11-14 05:31:02,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:02,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28203114] [2024-11-14 05:31:02,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:02,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:03,168 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-14 05:31:03,168 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:03,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28203114] [2024-11-14 05:31:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28203114] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:03,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:03,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:31:03,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607995955] [2024-11-14 05:31:03,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:03,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:03,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:03,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:03,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:03,170 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-14 05:31:03,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:03,490 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-14 05:31:03,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:31:03,491 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-14 05:31:03,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:03,492 INFO L225 Difference]: With dead ends: 82 [2024-11-14 05:31:03,492 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 05:31:03,493 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-14 05:31:03,494 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.3s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:03,494 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.3s Time] [2024-11-14 05:31:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 05:31:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-14 05:31:03,502 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-14 05:31:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-14 05:31:03,504 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 23 [2024-11-14 05:31:03,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:03,504 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-14 05:31:03,504 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-14 05:31:03,504 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-14 05:31:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 05:31:03,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:03,505 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-14 05:31:03,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-14 05:31:03,505 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-14 05:31:03,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:03,506 INFO L85 PathProgramCache]: Analyzing trace with hash 566988337, now seen corresponding path program 1 times [2024-11-14 05:31:03,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:03,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593851584] [2024-11-14 05:31:03,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:03,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:03,986 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-14 05:31:03,986 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:03,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593851584] [2024-11-14 05:31:03,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593851584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:03,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:03,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-14 05:31:03,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109190428] [2024-11-14 05:31:03,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:03,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-14 05:31:03,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:03,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-14 05:31:03,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-14 05:31:03,988 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-14 05:31:04,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:04,209 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-14 05:31:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:31:04,211 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-14 05:31:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:04,212 INFO L225 Difference]: With dead ends: 83 [2024-11-14 05:31:04,212 INFO L226 Difference]: Without dead ends: 82 [2024-11-14 05:31:04,212 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-14 05:31:04,213 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.2s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:04,213 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.2s Time] [2024-11-14 05:31:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-14 05:31:04,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-14 05:31:04,226 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-14 05:31:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-14 05:31:04,227 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 23 [2024-11-14 05:31:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:04,228 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-14 05:31:04,228 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-14 05:31:04,228 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-14 05:31:04,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-14 05:31:04,231 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:04,232 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-14 05:31:04,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-14 05:31:04,232 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-14 05:31:04,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash -195978738, now seen corresponding path program 1 times [2024-11-14 05:31:04,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:04,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399568985] [2024-11-14 05:31:04,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:04,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:04,421 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-14 05:31:04,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:04,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399568985] [2024-11-14 05:31:04,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399568985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:04,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:04,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:31:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934575803] [2024-11-14 05:31:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:04,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:04,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:04,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:04,424 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-14 05:31:04,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:04,714 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-14 05:31:04,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-14 05:31:04,715 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-14 05:31:04,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:04,716 INFO L225 Difference]: With dead ends: 82 [2024-11-14 05:31:04,716 INFO L226 Difference]: Without dead ends: 81 [2024-11-14 05:31:04,717 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-14 05:31:04,717 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-14 05:31:04,718 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-14 05:31:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-14 05:31:04,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-14 05:31:04,727 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-14 05:31:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-14 05:31:04,728 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 24 [2024-11-14 05:31:04,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:04,728 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-14 05:31:04,728 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-14 05:31:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-14 05:31:04,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 05:31:04,729 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:04,730 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-14 05:31:04,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-14 05:31:04,730 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-14 05:31:04,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1780373538, now seen corresponding path program 1 times [2024-11-14 05:31:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:04,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527159006] [2024-11-14 05:31:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:04,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:04,989 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-14 05:31:04,989 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:04,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527159006] [2024-11-14 05:31:04,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527159006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:04,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:04,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-14 05:31:04,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156373290] [2024-11-14 05:31:04,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:04,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-14 05:31:04,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:04,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-14 05:31:04,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-14 05:31:04,992 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-14 05:31:05,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:05,324 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-14 05:31:05,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:31:05,325 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-14 05:31:05,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:05,326 INFO L225 Difference]: With dead ends: 88 [2024-11-14 05:31:05,326 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 05:31:05,327 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-14 05:31:05,328 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-14 05:31:05,328 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-14 05:31:05,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 05:31:05,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-11-14 05:31:05,337 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-14 05:31:05,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-14 05:31:05,338 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 25 [2024-11-14 05:31:05,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:05,338 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-14 05:31:05,339 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-14 05:31:05,339 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-14 05:31:05,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 05:31:05,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:05,340 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-14 05:31:05,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-14 05:31:05,340 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-14 05:31:05,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:05,341 INFO L85 PathProgramCache]: Analyzing trace with hash 642995216, now seen corresponding path program 1 times [2024-11-14 05:31:05,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:05,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69092074] [2024-11-14 05:31:05,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:05,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:05,716 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-14 05:31:05,716 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69092074] [2024-11-14 05:31:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69092074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:31:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441295303] [2024-11-14 05:31:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:05,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:05,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:05,719 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-14 05:31:06,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:06,179 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2024-11-14 05:31:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:06,179 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-14 05:31:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:06,180 INFO L225 Difference]: With dead ends: 88 [2024-11-14 05:31:06,180 INFO L226 Difference]: Without dead ends: 87 [2024-11-14 05:31:06,181 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-14 05:31:06,182 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-14 05:31:06,182 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-14 05:31:06,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-14 05:31:06,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-14 05:31:06,191 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-14 05:31:06,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-14 05:31:06,192 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 26 [2024-11-14 05:31:06,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:06,192 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-14 05:31:06,192 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-14 05:31:06,193 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-14 05:31:06,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:31:06,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:06,193 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-14 05:31:06,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-14 05:31:06,194 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-14 05:31:06,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:06,194 INFO L85 PathProgramCache]: Analyzing trace with hash 406656694, now seen corresponding path program 1 times [2024-11-14 05:31:06,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494750192] [2024-11-14 05:31:06,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:31:06,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1441336188] [2024-11-14 05:31:06,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:06,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:06,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:06,228 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:06,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-14 05:31:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:06,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-14 05:31:06,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:06,453 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-14 05:31:06,453 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-14 05:31:06,481 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:31:06,481 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-14 05:31:06,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:06,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:06,547 INFO L349 Elim1Store]: treesize reduction 38, result has 35.6 percent of original size [2024-11-14 05:31:06,547 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-14 05:31:06,636 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-14 05:31:07,126 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-14 05:31:07,183 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-14 05:31:07,228 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-14 05:31:07,305 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-14 05:31:07,336 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-14 05:31:07,337 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:07,819 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-14 05:31:07,923 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-14 05:31:08,047 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-14 05:31:08,183 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494750192] [2024-11-14 05:31:08,183 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:31:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441336188] [2024-11-14 05:31:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441336188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:08,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1102924190] [2024-11-14 05:31:08,215 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:31:08,215 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:08,220 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 05:31:08,226 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:08,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-14 05:31:08,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440936999] [2024-11-14 05:31:08,226 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:08,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:31:08,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:08,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:31:08,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=190, Unknown=8, NotChecked=90, Total=342 [2024-11-14 05:31:08,230 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-14 05:31:08,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:08,852 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2024-11-14 05:31:08,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-14 05:31:08,853 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-14 05:31:08,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:08,854 INFO L225 Difference]: With dead ends: 121 [2024-11-14 05:31:08,854 INFO L226 Difference]: Without dead ends: 120 [2024-11-14 05:31:08,855 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-14 05:31:08,855 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-14 05:31:08,856 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-14 05:31:08,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-14 05:31:08,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2024-11-14 05:31:08,867 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-14 05:31:08,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2024-11-14 05:31:08,868 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 27 [2024-11-14 05:31:08,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:08,869 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2024-11-14 05:31:08,869 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-14 05:31:08,869 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2024-11-14 05:31:08,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-14 05:31:08,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:08,870 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-14 05:31:08,895 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-14 05:31:09,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-14 05:31:09,075 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-14 05:31:09,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:09,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1541984736, now seen corresponding path program 1 times [2024-11-14 05:31:09,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:09,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542838755] [2024-11-14 05:31:09,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:09,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:09,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:09,417 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-14 05:31:09,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:09,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542838755] [2024-11-14 05:31:09,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542838755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:09,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:09,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:31:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353422775] [2024-11-14 05:31:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:09,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:09,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:09,419 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-14 05:31:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:09,779 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2024-11-14 05:31:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 05:31:09,780 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-14 05:31:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:09,781 INFO L225 Difference]: With dead ends: 108 [2024-11-14 05:31:09,782 INFO L226 Difference]: Without dead ends: 107 [2024-11-14 05:31:09,782 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-14 05:31:09,783 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-14 05:31:09,783 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-14 05:31:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-14 05:31:09,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2024-11-14 05:31:09,798 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-14 05:31:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 118 transitions. [2024-11-14 05:31:09,800 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 118 transitions. Word has length 27 [2024-11-14 05:31:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:09,800 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 118 transitions. [2024-11-14 05:31:09,800 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-14 05:31:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 118 transitions. [2024-11-14 05:31:09,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:31:09,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:09,801 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-14 05:31:09,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-14 05:31:09,801 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-14 05:31:09,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:09,802 INFO L85 PathProgramCache]: Analyzing trace with hash -278544311, now seen corresponding path program 1 times [2024-11-14 05:31:09,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:09,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679926128] [2024-11-14 05:31:09,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:09,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:31:09,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [376602322] [2024-11-14 05:31:09,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:09,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:09,843 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:09,845 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:09,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-14 05:31:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:09,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-14 05:31:09,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:10,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,032 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-14 05:31:10,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,054 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-14 05:31:10,076 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-14 05:31:10,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,137 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-14 05:31:10,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:10,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:10,155 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-14 05:31:10,172 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-14 05:31:10,236 INFO L349 Elim1Store]: treesize reduction 28, result has 37.8 percent of original size [2024-11-14 05:31:10,236 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-14 05:31:10,253 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-14 05:31:10,319 INFO L349 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2024-11-14 05:31:10,319 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-14 05:31:10,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-14 05:31:10,372 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-14 05:31:10,414 INFO L349 Elim1Store]: treesize reduction 13, result has 51.9 percent of original size [2024-11-14 05:31:10,415 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-14 05:31:10,442 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2024-11-14 05:31:10,442 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-14 05:31:10,449 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-14 05:31:10,456 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-14 05:31:10,500 INFO L349 Elim1Store]: treesize reduction 28, result has 37.8 percent of original size [2024-11-14 05:31:10,501 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-14 05:31:10,546 INFO L349 Elim1Store]: treesize reduction 28, result has 22.2 percent of original size [2024-11-14 05:31:10,546 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-14 05:31:10,554 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-14 05:31:10,572 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-14 05:31:10,589 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-14 05:31:10,662 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 05:31:10,662 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-14 05:31:10,687 INFO L349 Elim1Store]: treesize reduction 19, result has 13.6 percent of original size [2024-11-14 05:31:10,688 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-14 05:31:10,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:10,700 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-14 05:31:10,733 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-14 05:31:10,734 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-14 05:31:10,767 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2024-11-14 05:31:10,767 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-14 05:31:10,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:10,779 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-14 05:31:10,803 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:31:10,803 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-14 05:31:11,045 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-14 05:31:11,087 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-14 05:31:11,121 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-14 05:31:11,195 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-14 05:31:11,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:16,051 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-14 05:31:16,222 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679926128] [2024-11-14 05:31:16,222 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:31:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376602322] [2024-11-14 05:31:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [376602322] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:16,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [340876382] [2024-11-14 05:31:16,226 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:31:16,226 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:16,227 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 05:31:16,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:16,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-14 05:31:16,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720180206] [2024-11-14 05:31:16,230 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:16,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 05:31:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:16,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 05:31:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=192, Unknown=5, NotChecked=28, Total=272 [2024-11-14 05:31:16,233 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-14 05:31:16,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:16,796 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2024-11-14 05:31:16,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-14 05:31:16,797 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-14 05:31:16,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:16,798 INFO L225 Difference]: With dead ends: 119 [2024-11-14 05:31:16,798 INFO L226 Difference]: Without dead ends: 118 [2024-11-14 05:31:16,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=78, Invalid=301, Unknown=5, NotChecked=36, Total=420 [2024-11-14 05:31:16,799 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 85 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:16,800 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.4s Time] [2024-11-14 05:31:16,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-14 05:31:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2024-11-14 05:31:16,814 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-14 05:31:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2024-11-14 05:31:16,816 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 28 [2024-11-14 05:31:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:16,816 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2024-11-14 05:31:16,816 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-14 05:31:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2024-11-14 05:31:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-14 05:31:16,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:16,820 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-14 05:31:16,848 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-14 05:31:17,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:17,022 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-14 05:31:17,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:17,023 INFO L85 PathProgramCache]: Analyzing trace with hash -556886510, now seen corresponding path program 1 times [2024-11-14 05:31:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:17,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482056509] [2024-11-14 05:31:17,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:17,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:17,373 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-14 05:31:17,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482056509] [2024-11-14 05:31:17,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482056509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 05:31:17,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 05:31:17,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-14 05:31:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732896633] [2024-11-14 05:31:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 05:31:17,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-14 05:31:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-14 05:31:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-14 05:31:17,376 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-14 05:31:17,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:17,537 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2024-11-14 05:31:17,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 05:31:17,538 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-14 05:31:17,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:17,540 INFO L225 Difference]: With dead ends: 108 [2024-11-14 05:31:17,541 INFO L226 Difference]: Without dead ends: 96 [2024-11-14 05:31:17,542 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-14 05:31:17,543 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-14 05:31:17,543 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-14 05:31:17,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-14 05:31:17,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-14 05:31:17,558 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-14 05:31:17,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 106 transitions. [2024-11-14 05:31:17,559 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 106 transitions. Word has length 28 [2024-11-14 05:31:17,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:17,559 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 106 transitions. [2024-11-14 05:31:17,560 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-14 05:31:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 106 transitions. [2024-11-14 05:31:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-14 05:31:17,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:17,560 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-14 05:31:17,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-14 05:31:17,562 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-14 05:31:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:17,563 INFO L85 PathProgramCache]: Analyzing trace with hash -44938984, now seen corresponding path program 1 times [2024-11-14 05:31:17,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:17,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735941014] [2024-11-14 05:31:17,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:18,980 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-14 05:31:18,981 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735941014] [2024-11-14 05:31:18,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735941014] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:18,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937159537] [2024-11-14 05:31:18,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:18,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:18,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:18,984 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:19,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-14 05:31:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:19,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 05:31:19,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:19,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:19,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:19,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:19,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:19,534 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-11-14 05:31:19,534 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-14 05:31:19,586 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-14 05:31:19,619 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-14 05:31:19,679 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:31:19,680 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-14 05:31:20,011 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-14 05:31:20,237 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-14 05:31:20,328 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-14 05:31:20,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:20,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:20,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:20,507 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:20,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:20,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:20,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:20,583 INFO L224 Elim1Store]: Index analysis took 131 ms [2024-11-14 05:31:20,680 INFO L349 Elim1Store]: treesize reduction 81, result has 17.3 percent of original size [2024-11-14 05:31:20,681 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-14 05:31:21,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,194 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,195 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,239 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,240 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,242 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-14 05:31:21,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,682 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,697 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,703 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,704 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:21,706 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-14 05:31:21,736 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2024-11-14 05:31:21,737 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-14 05:31:21,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:21,839 INFO L349 Elim1Store]: treesize reduction 36, result has 18.2 percent of original size [2024-11-14 05:31:21,839 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-14 05:31:22,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:22,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:22,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:22,241 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-14 05:31:22,247 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-14 05:31:22,258 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-14 05:31:23,135 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-14 05:31:23,237 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-14 05:31:23,349 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-14 05:31:23,634 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-14 05:31:23,665 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-14 05:31:23,665 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:24,058 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-14 05:31:24,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937159537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:24,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [116597953] [2024-11-14 05:31:24,132 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:31:24,133 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:24,133 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 05:31:24,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:31:24,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 23 [2024-11-14 05:31:24,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171726559] [2024-11-14 05:31:24,135 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:24,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:31:24,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:24,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:31:24,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=713, Unknown=1, NotChecked=54, Total=870 [2024-11-14 05:31:24,138 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-14 05:31:26,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:26,094 INFO L93 Difference]: Finished difference Result 98 states and 109 transitions. [2024-11-14 05:31:26,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:31:26,101 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-14 05:31:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:26,102 INFO L225 Difference]: With dead ends: 98 [2024-11-14 05:31:26,102 INFO L226 Difference]: Without dead ends: 95 [2024-11-14 05:31:26,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=246, Invalid=1479, Unknown=1, NotChecked=80, Total=1806 [2024-11-14 05:31:26,105 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 203 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 653 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:26,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 372 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 653 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-14 05:31:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-14 05:31:26,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-14 05:31:26,125 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-14 05:31:26,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2024-11-14 05:31:26,127 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 29 [2024-11-14 05:31:26,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:26,128 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2024-11-14 05:31:26,128 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-14 05:31:26,128 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2024-11-14 05:31:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-14 05:31:26,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:26,129 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-14 05:31:26,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-14 05:31:26,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:26,330 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-14 05:31:26,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1393108437, now seen corresponding path program 1 times [2024-11-14 05:31:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:26,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174805749] [2024-11-14 05:31:26,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:26,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:27,510 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-14 05:31:27,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:27,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174805749] [2024-11-14 05:31:27,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174805749] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:27,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [55521538] [2024-11-14 05:31:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:27,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:27,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:27,514 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:27,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-14 05:31:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:27,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-14 05:31:27,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:27,705 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-14 05:31:27,742 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-14 05:31:27,742 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-14 05:31:27,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:27,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:27,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:27,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:27,759 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-14 05:31:27,767 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-14 05:31:27,783 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:31:27,784 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-14 05:31:27,835 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-14 05:31:28,409 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-14 05:31:28,496 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-14 05:31:28,574 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-14 05:31:28,803 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-14 05:31:28,835 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-14 05:31:28,835 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:29,145 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-14 05:31:29,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [55521538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:29,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [230337703] [2024-11-14 05:31:29,214 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:31:29,214 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:29,219 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 05:31:29,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:31:29,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 22 [2024-11-14 05:31:29,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237881188] [2024-11-14 05:31:29,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:29,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-14 05:31:29,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:29,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-14 05:31:29,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=644, Unknown=1, NotChecked=52, Total=812 [2024-11-14 05:31:29,222 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-14 05:31:30,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:30,392 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-14 05:31:30,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-14 05:31:30,393 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-14 05:31:30,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:30,394 INFO L225 Difference]: With dead ends: 104 [2024-11-14 05:31:30,394 INFO L226 Difference]: Without dead ends: 103 [2024-11-14 05:31:30,398 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-14 05:31:30,399 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.5s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:30,399 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.5s Time] [2024-11-14 05:31:30,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-14 05:31:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 95. [2024-11-14 05:31:30,415 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-14 05:31:30,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2024-11-14 05:31:30,417 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 30 [2024-11-14 05:31:30,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:30,417 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2024-11-14 05:31:30,417 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-14 05:31:30,417 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2024-11-14 05:31:30,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 05:31:30,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:30,418 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-14 05:31:30,444 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-14 05:31:30,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:30,622 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-14 05:31:30,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:30,623 INFO L85 PathProgramCache]: Analyzing trace with hash -236688518, now seen corresponding path program 1 times [2024-11-14 05:31:30,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:30,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793264019] [2024-11-14 05:31:30,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:30,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-14 05:31:30,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1262759045] [2024-11-14 05:31:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:30,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:30,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:30,675 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:30,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-14 05:31:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:30,837 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-14 05:31:30,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:30,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:30,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:30,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:31,121 INFO L349 Elim1Store]: treesize reduction 188, result has 24.5 percent of original size [2024-11-14 05:31:31,121 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-14 05:31:31,184 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:31:31,184 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-14 05:31:31,235 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-14 05:31:31,270 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-14 05:31:31,620 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-14 05:31:31,689 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-14 05:31:31,764 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-14 05:31:34,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:34,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:34,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:34,519 INFO L349 Elim1Store]: treesize reduction 111, result has 24.5 percent of original size [2024-11-14 05:31:34,521 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-14 05:31:34,762 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2024-11-14 05:31:34,765 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-14 05:31:34,812 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-14 05:31:35,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:35,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:35,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:35,896 INFO L349 Elim1Store]: treesize reduction 37, result has 19.6 percent of original size [2024-11-14 05:31:35,897 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-14 05:31:36,132 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-14 05:31:36,192 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-14 05:31:36,366 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-14 05:31:36,424 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-14 05:31:36,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:40,250 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-14 05:31:40,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:40,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793264019] [2024-11-14 05:31:40,539 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-14 05:31:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262759045] [2024-11-14 05:31:40,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262759045] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:40,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1028700381] [2024-11-14 05:31:40,541 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:31:40,541 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:40,541 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 05:31:40,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-14 05:31:40,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2024-11-14 05:31:40,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440284499] [2024-11-14 05:31:40,543 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:40,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-14 05:31:40,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:40,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-14 05:31:40,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=4, NotChecked=32, Total=342 [2024-11-14 05:31:40,545 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-14 05:31:41,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:42,986 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-14 05:31:42,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:31:42,987 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-14 05:31:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:42,988 INFO L225 Difference]: With dead ends: 103 [2024-11-14 05:31:42,988 INFO L226 Difference]: Without dead ends: 102 [2024-11-14 05:31:42,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=4, NotChecked=40, Total=506 [2024-11-14 05:31:42,989 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 5 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:42,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 260 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 309 Invalid, 5 Unknown, 0 Unchecked, 2.0s Time] [2024-11-14 05:31:42,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-14 05:31:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 95. [2024-11-14 05:31:43,002 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-14 05:31:43,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2024-11-14 05:31:43,004 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 31 [2024-11-14 05:31:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2024-11-14 05:31:43,004 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-14 05:31:43,004 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2024-11-14 05:31:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-14 05:31:43,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:43,005 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-14 05:31:43,029 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-14 05:31:43,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:43,209 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-14 05:31:43,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1252590605, now seen corresponding path program 1 times [2024-11-14 05:31:43,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:43,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193347206] [2024-11-14 05:31:43,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:43,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:43,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:44,374 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-14 05:31:44,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 05:31:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193347206] [2024-11-14 05:31:44,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193347206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:44,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293207912] [2024-11-14 05:31:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:44,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 05:31:44,377 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-14 05:31:44,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-14 05:31:44,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 05:31:44,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-14 05:31:44,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 05:31:44,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,709 INFO L349 Elim1Store]: treesize reduction 78, result has 36.6 percent of original size [2024-11-14 05:31:44,709 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-14 05:31:44,743 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-14 05:31:44,743 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-14 05:31:44,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,808 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-14 05:31:44,816 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-14 05:31:44,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:44,838 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-14 05:31:44,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,887 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-14 05:31:44,894 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-14 05:31:44,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-14 05:31:44,911 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-14 05:31:44,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,958 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-14 05:31:44,965 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:31:44,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:44,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-14 05:31:45,000 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-14 05:31:45,006 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-14 05:31:45,970 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-14 05:31:46,116 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-14 05:31:46,116 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-14 05:31:46,303 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-14 05:31:46,685 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-14 05:31:46,962 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-14 05:31:46,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-14 05:31:49,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293207912] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-14 05:31:49,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1732197751] [2024-11-14 05:31:49,242 INFO L159 IcfgInterpreter]: Started Sifa with 25 locations of interest [2024-11-14 05:31:49,242 INFO L166 IcfgInterpreter]: Building call graph [2024-11-14 05:31:49,242 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:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) 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-14 05:31:49,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-14 05:31:49,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 23 [2024-11-14 05:31:49,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495673359] [2024-11-14 05:31:49,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-14 05:31:49,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-14 05:31:49,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 05:31:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-14 05:31:49,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=825, Unknown=0, NotChecked=0, Total=930 [2024-11-14 05:31:49,246 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-14 05:31:52,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-14 05:31:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 05:31:53,195 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-14 05:31:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-14 05:31:53,196 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-14 05:31:53,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 05:31:53,196 INFO L225 Difference]: With dead ends: 102 [2024-11-14 05:31:53,197 INFO L226 Difference]: Without dead ends: 101 [2024-11-14 05:31:53,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=200, Invalid=1360, Unknown=0, NotChecked=0, Total=1560 [2024-11-14 05:31:53,198 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 125 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 14 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.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, 524 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-14 05:31:53,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 463 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 524 Invalid, 1 Unknown, 0 Unchecked, 3.1s Time] [2024-11-14 05:31:53,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-14 05:31:53,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2024-11-14 05:31:53,213 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-14 05:31:53,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2024-11-14 05:31:53,214 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 32 [2024-11-14 05:31:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 05:31:53,215 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2024-11-14 05:31:53,215 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-14 05:31:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2024-11-14 05:31:53,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-14 05:31:53,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 05:31:53,216 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-14 05:31:53,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-14 05:31:53,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03491f99-60f2-4ee5-8d8a-d218f9b47230/bin/utaipan-verify-sOmjnqqW8E/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-14 05:31:53,420 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-14 05:31:53,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 05:31:53,421 INFO L85 PathProgramCache]: Analyzing trace with hash 175603164, now seen corresponding path program 1 times [2024-11-14 05:31:53,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 05:31:53,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475005032] [2024-11-14 05:31:53,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 05:31:53,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 05:31:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat