./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dfbeed813c4c61f00fa3f37e016718a299be7911d54e721c8910a31480a25397 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:45:42,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:45:42,376 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:45:42,381 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:45:42,382 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:45:42,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:45:42,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:45:42,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:45:42,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:45:42,402 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:45:42,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:45:42,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:45:42,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:45:42,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:45:42,403 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:45:42,404 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:45:42,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:45:42,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:45:42,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:45:42,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:45:42,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:45:42,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:45:42,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:45:42,406 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dfbeed813c4c61f00fa3f37e016718a299be7911d54e721c8910a31480a25397 [2025-03-09 02:45:42,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:45:42,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:45:42,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:45:42,648 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:45:42,648 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:45:42,650 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c [2025-03-09 02:45:43,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a41d7003/15d2bccedcd54780bda31a8ff18240fb/FLAGc9932b842 [2025-03-09 02:45:44,127 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:45:44,128 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_hard-ll.c [2025-03-09 02:45:44,134 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a41d7003/15d2bccedcd54780bda31a8ff18240fb/FLAGc9932b842 [2025-03-09 02:45:44,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a41d7003/15d2bccedcd54780bda31a8ff18240fb [2025-03-09 02:45:44,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:45:44,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:45:44,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:45:44,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:45:44,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:45:44,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28de8d8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44, skipping insertion in model container [2025-03-09 02:45:44,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:45:44,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:45:44,302 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:45:44,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:45:44,337 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:45:44,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44 WrapperNode [2025-03-09 02:45:44,338 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:45:44,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:45:44,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:45:44,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:45:44,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,363 INFO L138 Inliner]: procedures = 17, calls = 85, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 87 [2025-03-09 02:45:44,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:45:44,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:45:44,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:45:44,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:45:44,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,373 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,390 INFO L175 MemorySlicer]: Split 49 memory accesses to 7 slices as follows [2, 9, 7, 8, 6, 5, 12]. 24 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0, 0]. The 12 writes are split as follows [0, 3, 1, 2, 2, 1, 3]. [2025-03-09 02:45:44,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,395 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:45:44,402 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:45:44,402 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:45:44,402 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:45:44,403 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (1/1) ... [2025-03-09 02:45:44,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:45:44,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:44,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:45:44,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:45:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:45:44,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_41_to_51_0 [2025-03-09 02:45:44,448 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_41_to_51_0 [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 02:45:44,448 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_31_to_38_0 [2025-03-09 02:45:44,449 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_31_to_38_0 [2025-03-09 02:45:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 02:45:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 02:45:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 02:45:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 02:45:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 02:45:44,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 02:45:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-09 02:45:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:45:44,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:45:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 02:45:44,450 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:45:44,451 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:45:44,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 02:45:44,522 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:45:44,523 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:45:44,786 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L110: call ULTIMATE.dealloc(main_~#A~0#1.base, main_~#A~0#1.offset);havoc main_~#A~0#1.base, main_~#A~0#1.offset;call ULTIMATE.dealloc(main_~#B~0#1.base, main_~#B~0#1.offset);havoc main_~#B~0#1.base, main_~#B~0#1.offset;call ULTIMATE.dealloc(main_~#r~0#1.base, main_~#r~0#1.offset);havoc main_~#r~0#1.base, main_~#r~0#1.offset;call ULTIMATE.dealloc(main_~#d~0#1.base, main_~#d~0#1.offset);havoc main_~#d~0#1.base, main_~#d~0#1.offset;call ULTIMATE.dealloc(main_~#p~0#1.base, main_~#p~0#1.offset);havoc main_~#p~0#1.base, main_~#p~0#1.offset;call ULTIMATE.dealloc(main_~#q~0#1.base, main_~#q~0#1.offset);havoc main_~#q~0#1.base, main_~#q~0#1.offset; [2025-03-09 02:45:44,805 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2025-03-09 02:45:44,806 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:45:44,818 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:45:44,820 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:45:44,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:45:44 BoogieIcfgContainer [2025-03-09 02:45:44,821 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:45:44,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:45:44,823 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:45:44,827 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:45:44,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:45:44" (1/3) ... [2025-03-09 02:45:44,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18adf9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:45:44, skipping insertion in model container [2025-03-09 02:45:44,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:45:44" (2/3) ... [2025-03-09 02:45:44,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18adf9ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:45:44, skipping insertion in model container [2025-03-09 02:45:44,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:45:44" (3/3) ... [2025-03-09 02:45:44,829 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_hard-ll.c [2025-03-09 02:45:44,840 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:45:44,842 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_hard-ll.c that has 4 procedures, 91 locations, 1 initial locations, 0 loop locations, and 24 error locations. [2025-03-09 02:45:44,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:45:44,897 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=PETRI_NET, 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;@234d065, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:45:44,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2025-03-09 02:45:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 78 states have internal predecessors, (83), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:45:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 02:45:44,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:44,908 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:44,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:45:44,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2124294046, now seen corresponding path program 1 times [2025-03-09 02:45:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698995970] [2025-03-09 02:45:44,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:44,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:44,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 02:45:45,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 02:45:45,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:45,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:45,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:45:45,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:45,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698995970] [2025-03-09 02:45:45,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698995970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:45,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:45,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:45:45,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418728035] [2025-03-09 02:45:45,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:45,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:45:45,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:45,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:45:45,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:45:45,105 INFO L87 Difference]: Start difference. First operand has 91 states, 52 states have (on average 1.5961538461538463) internal successors, (83), 78 states have internal predecessors, (83), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 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) [2025-03-09 02:45:45,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:45:45,132 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2025-03-09 02:45:45,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:45:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 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 13 [2025-03-09 02:45:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:45:45,140 INFO L225 Difference]: With dead ends: 178 [2025-03-09 02:45:45,140 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 02:45:45,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:45:45,148 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:45:45,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:45:45,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 02:45:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-09 02:45:45,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 46 states have (on average 1.565217391304348) internal successors, (72), 71 states have internal predecessors, (72), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:45:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-09 02:45:45,191 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 13 [2025-03-09 02:45:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:45:45,193 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-09 02:45:45,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 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) [2025-03-09 02:45:45,193 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-09 02:45:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-09 02:45:45,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:45:45,194 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:45:45,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:45:45,195 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_31_to_38_0Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:45:45,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:45:45,195 INFO L85 PathProgramCache]: Analyzing trace with hash 308776765, now seen corresponding path program 1 times [2025-03-09 02:45:45,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:45:45,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361758722] [2025-03-09 02:45:45,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:45,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:45:45,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:45:45,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:45:45,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:45,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:45:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1540167610] [2025-03-09 02:45:45,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:45:45,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:45:45,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:45:45,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:45:45,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:45:45,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 02:45:45,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 02:45:45,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:45:45,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:45:45,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:45:45,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:45:45,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:45:45,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:45:45,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:45:45,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:45:45,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:45:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361758722] [2025-03-09 02:45:45,619 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:45:45,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540167610] [2025-03-09 02:45:45,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1540167610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:45:45,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:45:45,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:45:45,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665892031] [2025-03-09 02:45:45,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:45:45,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:45:45,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:45:45,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:45:45,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:45:45,623 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:45:49,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:53,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:45:57,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:01,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:05,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:09,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:13,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-09 02:46:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:13,815 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2025-03-09 02:46:13,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:13,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2025-03-09 02:46:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:13,821 INFO L225 Difference]: With dead ends: 148 [2025-03-09 02:46:13,821 INFO L226 Difference]: Without dead ends: 147 [2025-03-09 02:46:13,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:13,821 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 90 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:13,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 343 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 7 Unknown, 0 Unchecked, 28.1s Time] [2025-03-09 02:46:13,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-09 02:46:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2025-03-09 02:46:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.5) internal successors, (105), 95 states have internal predecessors, (105), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-09 02:46:13,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 137 transitions. [2025-03-09 02:46:13,839 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 137 transitions. Word has length 20 [2025-03-09 02:46:13,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:13,839 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 137 transitions. [2025-03-09 02:46:13,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 137 transitions. [2025-03-09 02:46:13,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 02:46:13,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:13,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:13,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:14,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:14,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_31_to_38_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:46:14,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:14,043 INFO L85 PathProgramCache]: Analyzing trace with hash 982145151, now seen corresponding path program 1 times [2025-03-09 02:46:14,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:14,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492507390] [2025-03-09 02:46:14,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:14,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:14,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:46:14,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:46:14,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:14,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:14,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [480584431] [2025-03-09 02:46:14,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:14,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:14,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:14,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:14,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:46:14,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 02:46:14,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 02:46:14,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:14,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:14,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 02:46:14,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:14,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-09 02:46:14,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 02:46:14,318 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:46:14,319 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:14,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492507390] [2025-03-09 02:46:14,319 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:14,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480584431] [2025-03-09 02:46:14,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480584431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:14,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:14,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:14,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079934867] [2025-03-09 02:46:14,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:14,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:14,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:14,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:14,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:14,320 INFO L87 Difference]: Start difference. First operand 115 states and 137 transitions. Second operand has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:14,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:14,440 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2025-03-09 02:46:14,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:14,441 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2025-03-09 02:46:14,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:14,442 INFO L225 Difference]: With dead ends: 147 [2025-03-09 02:46:14,442 INFO L226 Difference]: Without dead ends: 146 [2025-03-09 02:46:14,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:14,442 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 71 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:14,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 430 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:14,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-09 02:46:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 115. [2025-03-09 02:46:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 70 states have (on average 1.4857142857142858) internal successors, (104), 95 states have internal predecessors, (104), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (17), 15 states have call predecessors, (17), 15 states have call successors, (17) [2025-03-09 02:46:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-03-09 02:46:14,450 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 21 [2025-03-09 02:46:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:14,450 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-03-09 02:46:14,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 02:46:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-03-09 02:46:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 02:46:14,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:14,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:14,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:46:14,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-09 02:46:14,652 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_31_to_38_0Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:46:14,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1320036381, now seen corresponding path program 1 times [2025-03-09 02:46:14,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688172559] [2025-03-09 02:46:14,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:14,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 02:46:14,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 02:46:14,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:14,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:15,007 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:46:15,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688172559] [2025-03-09 02:46:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688172559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333310433] [2025-03-09 02:46:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:15,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:15,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:15,010 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:46:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:15,113 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2025-03-09 02:46:15,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2025-03-09 02:46:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:15,115 INFO L225 Difference]: With dead ends: 119 [2025-03-09 02:46:15,115 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 02:46:15,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:15,115 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:15,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 330 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 02:46:15,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2025-03-09 02:46:15,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 95 states have internal predecessors, (104), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-03-09 02:46:15,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2025-03-09 02:46:15,125 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 29 [2025-03-09 02:46:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:15,128 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2025-03-09 02:46:15,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:46:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2025-03-09 02:46:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:46:15,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:15,129 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:15,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:46:15,129 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_31_to_38_0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:46:15,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:15,129 INFO L85 PathProgramCache]: Analyzing trace with hash -2028545131, now seen corresponding path program 1 times [2025-03-09 02:46:15,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:15,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433443085] [2025-03-09 02:46:15,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:15,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:46:15,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:46:15,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:15,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:15,512 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:46:15,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:15,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433443085] [2025-03-09 02:46:15,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433443085] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:15,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:15,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:15,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845675023] [2025-03-09 02:46:15,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:15,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:15,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:15,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:15,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:15,515 INFO L87 Difference]: Start difference. First operand 116 states and 137 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:46:15,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:15,648 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2025-03-09 02:46:15,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:46:15,649 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-09 02:46:15,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:15,650 INFO L225 Difference]: With dead ends: 116 [2025-03-09 02:46:15,650 INFO L226 Difference]: Without dead ends: 115 [2025-03-09 02:46:15,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:46:15,650 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 30 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:15,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 392 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:15,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-09 02:46:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-09 02:46:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 94 states have internal predecessors, (103), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-03-09 02:46:15,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 136 transitions. [2025-03-09 02:46:15,668 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 136 transitions. Word has length 30 [2025-03-09 02:46:15,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:15,668 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 136 transitions. [2025-03-09 02:46:15,669 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:46:15,669 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 136 transitions. [2025-03-09 02:46:15,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-09 02:46:15,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:15,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:46:15,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:46:15,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_31_to_38_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:46:15,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:15,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1539610395, now seen corresponding path program 1 times [2025-03-09 02:46:15,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:15,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262948246] [2025-03-09 02:46:15,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:15,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:15,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 02:46:15,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 02:46:15,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:15,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:46:15,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262948246] [2025-03-09 02:46:15,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262948246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:15,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:15,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 02:46:15,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518750633] [2025-03-09 02:46:15,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:15,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:46:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:15,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:46:15,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:46:15,850 INFO L87 Difference]: Start difference. First operand 115 states and 136 transitions. Second operand has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:46:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:15,937 INFO L93 Difference]: Finished difference Result 121 states and 142 transitions. [2025-03-09 02:46:15,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:46:15,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-09 02:46:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:15,938 INFO L225 Difference]: With dead ends: 121 [2025-03-09 02:46:15,938 INFO L226 Difference]: Without dead ends: 119 [2025-03-09 02:46:15,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:46:15,939 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 18 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:15,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 371 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:15,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-09 02:46:15,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-09 02:46:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 98 states have internal predecessors, (107), 15 states have call successors, (15), 6 states have call predecessors, (15), 7 states have return successors, (18), 15 states have call predecessors, (18), 15 states have call successors, (18) [2025-03-09 02:46:15,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2025-03-09 02:46:15,950 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 31 [2025-03-09 02:46:15,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:15,950 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2025-03-09 02:46:15,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-09 02:46:15,950 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2025-03-09 02:46:15,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-09 02:46:15,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:15,951 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-09 02:46:15,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:46:15,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_41_to_51_0Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:46:15,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:15,952 INFO L85 PathProgramCache]: Analyzing trace with hash -583957190, now seen corresponding path program 1 times [2025-03-09 02:46:15,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:15,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908751465] [2025-03-09 02:46:15,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:15,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:15,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:46:15,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:46:15,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:15,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:46:15,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1581866795] [2025-03-09 02:46:15,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:15,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:15,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:46:15,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:46:15,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:46:16,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 02:46:16,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 02:46:16,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:16,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:46:16,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-09 02:46:16,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:46:16,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 02:46:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:46:16,218 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:46:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:46:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908751465] [2025-03-09 02:46:16,218 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:46:16,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581866795] [2025-03-09 02:46:16,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581866795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:46:16,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:46:16,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:46:16,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374544703] [2025-03-09 02:46:16,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:46:16,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:46:16,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:46:16,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:46:16,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:46:16,219 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:46:16,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:46:16,375 INFO L93 Difference]: Finished difference Result 176 states and 205 transitions. [2025-03-09 02:46:16,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:46:16,376 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2025-03-09 02:46:16,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:46:16,377 INFO L225 Difference]: With dead ends: 176 [2025-03-09 02:46:16,377 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 02:46:16,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:46:16,378 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 95 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:46:16,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 387 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:46:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 02:46:16,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 146. [2025-03-09 02:46:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 120 states have internal predecessors, (136), 18 states have call successors, (18), 8 states have call predecessors, (18), 10 states have return successors, (26), 18 states have call predecessors, (26), 18 states have call successors, (26) [2025-03-09 02:46:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 180 transitions. [2025-03-09 02:46:16,397 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 180 transitions. Word has length 34 [2025-03-09 02:46:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:46:16,397 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 180 transitions. [2025-03-09 02:46:16,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:46:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 180 transitions. [2025-03-09 02:46:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:46:16,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:46:16,398 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-09 02:46:16,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 02:46:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:46:16,602 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_41_to_51_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_41_to_51_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_41_to_51_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 22 more)] === [2025-03-09 02:46:16,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:46:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1457856344, now seen corresponding path program 1 times [2025-03-09 02:46:16,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:46:16,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394010027] [2025-03-09 02:46:16,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:46:16,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:46:16,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:46:16,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:46:16,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:46:16,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat