./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat1-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat1-ll.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 82b98e74657ce84706a43470df686c21fc227d1db1df507636ad5f146dee0144 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 10:03:55,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 10:03:55,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 10:03:55,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 10:03:55,442 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 10:03:55,459 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 10:03:55,460 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 10:03:55,460 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 10:03:55,460 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 10:03:55,460 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 10:03:55,460 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 10:03:55,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 10:03:55,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 10:03:55,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 10:03:55,462 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 10:03:55,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 10:03:55,462 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 10:03:55,462 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 10:03:55,463 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 10:03:55,463 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:03:55,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 10:03:55,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 10:03:55,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 10:03:55,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 10:03:55,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 10:03:55,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 10:03:55,465 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 10:03:55,465 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 10:03:55,465 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-jdk21/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 -> 82b98e74657ce84706a43470df686c21fc227d1db1df507636ad5f146dee0144 [2025-02-08 10:03:55,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 10:03:55,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 10:03:55,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 10:03:55,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 10:03:55,688 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 10:03:55,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_fermat1-ll.c [2025-02-08 10:03:56,836 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54d5843b7/35d2f8adca4944bcbb9edb1a724d144a/FLAG5a16c8eb3 [2025-02-08 10:03:57,033 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 10:03:57,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_fermat1-ll.c [2025-02-08 10:03:57,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54d5843b7/35d2f8adca4944bcbb9edb1a724d144a/FLAG5a16c8eb3 [2025-02-08 10:03:57,405 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/54d5843b7/35d2f8adca4944bcbb9edb1a724d144a [2025-02-08 10:03:57,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 10:03:57,408 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 10:03:57,409 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 10:03:57,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 10:03:57,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 10:03:57,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2334be49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57, skipping insertion in model container [2025-02-08 10:03:57,413 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 10:03:57,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:03:57,549 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 10:03:57,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 10:03:57,590 INFO L204 MainTranslator]: Completed translation [2025-02-08 10:03:57,590 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57 WrapperNode [2025-02-08 10:03:57,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 10:03:57,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 10:03:57,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 10:03:57,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 10:03:57,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,627 INFO L138 Inliner]: procedures = 18, calls = 83, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 103 [2025-02-08 10:03:57,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 10:03:57,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 10:03:57,628 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 10:03:57,628 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 10:03:57,634 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,656 INFO L175 MemorySlicer]: Split 53 memory accesses to 5 slices as follows [2, 16, 16, 11, 8]. 30 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 8 writes are split as follows [0, 2, 2, 3, 1]. [2025-02-08 10:03:57,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,667 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 10:03:57,675 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 10:03:57,675 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 10:03:57,675 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 10:03:57,676 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (1/1) ... [2025-02-08 10:03:57,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 10:03:57,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:57,699 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 10:03:57,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_33_to_36_0 [2025-02-08 10:03:57,717 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_33_to_36_0 [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-08 10:03:57,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-08 10:03:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_38_to_43_0 [2025-02-08 10:03:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_38_to_43_0 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_46_to_51_0 [2025-02-08 10:03:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_46_to_51_0 [2025-02-08 10:03:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 10:03:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 10:03:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 10:03:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 10:03:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 10:03:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-08 10:03:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-08 10:03:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-02-08 10:03:57,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-02-08 10:03:57,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 10:03:57,802 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 10:03:57,803 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 10:03:58,269 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L119: 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_~#u~0#1.base, main_~#u~0#1.offset);havoc main_~#u~0#1.base, main_~#u~0#1.offset;call ULTIMATE.dealloc(main_~#v~0#1.base, main_~#v~0#1.offset);havoc main_~#v~0#1.base, main_~#v~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; [2025-02-08 10:03:58,294 INFO L? ?]: Removed 228 outVars from TransFormulas that were not future-live. [2025-02-08 10:03:58,294 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 10:03:58,305 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 10:03:58,306 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 10:03:58,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:58 BoogieIcfgContainer [2025-02-08 10:03:58,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 10:03:58,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 10:03:58,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 10:03:58,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 10:03:58,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 10:03:57" (1/3) ... [2025-02-08 10:03:58,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173b7f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:03:58, skipping insertion in model container [2025-02-08 10:03:58,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 10:03:57" (2/3) ... [2025-02-08 10:03:58,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173b7f36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 10:03:58, skipping insertion in model container [2025-02-08 10:03:58,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 10:03:58" (3/3) ... [2025-02-08 10:03:58,314 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_fermat1-ll.c [2025-02-08 10:03:58,324 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 10:03:58,325 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_fermat1-ll.c that has 6 procedures, 230 locations, 1 initial locations, 0 loop locations, and 92 error locations. [2025-02-08 10:03:58,361 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 10:03:58,369 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;@4ba090e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 10:03:58,369 INFO L334 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2025-02-08 10:03:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand has 230 states, 120 states have (on average 1.8333333333333333) internal successors, (220), 215 states have internal predecessors, (220), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-02-08 10:03:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 10:03:58,375 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:58,376 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 10:03:58,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_36_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_36_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 90 more)] === [2025-02-08 10:03:58,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:58,381 INFO L85 PathProgramCache]: Analyzing trace with hash 8384, now seen corresponding path program 1 times [2025-02-08 10:03:58,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:58,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545935860] [2025-02-08 10:03:58,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:58,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:58,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 10:03:58,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 10:03:58,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:58,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:58,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:58,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:58,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545935860] [2025-02-08 10:03:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545935860] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:58,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 10:03:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838307690] [2025-02-08 10:03:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:58,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:03:58,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:58,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:03:58,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:03:58,549 INFO L87 Difference]: Start difference. First operand has 230 states, 120 states have (on average 1.8333333333333333) internal successors, (220), 215 states have internal predecessors, (220), 12 states have call successors, (12), 5 states have call predecessors, (12), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:58,640 INFO L93 Difference]: Finished difference Result 443 states and 485 transitions. [2025-02-08 10:03:58,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:03:58,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 10:03:58,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:58,649 INFO L225 Difference]: With dead ends: 443 [2025-02-08 10:03:58,650 INFO L226 Difference]: Without dead ends: 219 [2025-02-08 10:03:58,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:03:58,660 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 15 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:58,661 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 416 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:58,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-08 10:03:58,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-02-08 10:03:58,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 117 states have (on average 1.7521367521367521) internal successors, (205), 205 states have internal predecessors, (205), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:03:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 227 transitions. [2025-02-08 10:03:58,712 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 227 transitions. Word has length 2 [2025-02-08 10:03:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:58,712 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 227 transitions. [2025-02-08 10:03:58,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 227 transitions. [2025-02-08 10:03:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-08 10:03:58,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:58,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-08 10:03:58,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 10:03:58,713 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_36_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_36_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 90 more)] === [2025-02-08 10:03:58,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:58,714 INFO L85 PathProgramCache]: Analyzing trace with hash 260102, now seen corresponding path program 1 times [2025-02-08 10:03:58,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:58,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131392171] [2025-02-08 10:03:58,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:58,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:58,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 10:03:58,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 10:03:58,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:58,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131392171] [2025-02-08 10:03:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131392171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:58,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:58,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 10:03:58,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204029783] [2025-02-08 10:03:58,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:58,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:03:58,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:58,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:03:58,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:03:58,793 INFO L87 Difference]: Start difference. First operand 219 states and 227 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:58,844 INFO L93 Difference]: Finished difference Result 219 states and 227 transitions. [2025-02-08 10:03:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:03:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-08 10:03:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:58,846 INFO L225 Difference]: With dead ends: 219 [2025-02-08 10:03:58,847 INFO L226 Difference]: Without dead ends: 215 [2025-02-08 10:03:58,848 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:03:58,848 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 14 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:58,849 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 405 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:58,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-02-08 10:03:58,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-02-08 10:03:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 117 states have (on average 1.7179487179487178) internal successors, (201), 201 states have internal predecessors, (201), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:03:58,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 223 transitions. [2025-02-08 10:03:58,863 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 223 transitions. Word has length 3 [2025-02-08 10:03:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:58,863 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 223 transitions. [2025-02-08 10:03:58,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 223 transitions. [2025-02-08 10:03:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-08 10:03:58,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:58,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-08 10:03:58,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 10:03:58,864 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_36_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_36_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 90 more)] === [2025-02-08 10:03:58,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:58,865 INFO L85 PathProgramCache]: Analyzing trace with hash -302477822, now seen corresponding path program 1 times [2025-02-08 10:03:58,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:58,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729041906] [2025-02-08 10:03:58,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:58,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:58,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:03:58,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:03:58,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:58,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:03:58,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1774584601] [2025-02-08 10:03:58,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:58,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:58,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:58,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:03:58,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 10:03:58,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 10:03:58,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 10:03:58,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:58,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:58,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 10:03:58,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:59,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 10:03:59,029 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:59,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729041906] [2025-02-08 10:03:59,030 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:03:59,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774584601] [2025-02-08 10:03:59,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774584601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:59,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:59,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 10:03:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890629663] [2025-02-08 10:03:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:59,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 10:03:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:59,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 10:03:59,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:03:59,032 INFO L87 Difference]: Start difference. First operand 215 states and 223 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:59,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:59,072 INFO L93 Difference]: Finished difference Result 215 states and 223 transitions. [2025-02-08 10:03:59,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 10:03:59,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-08 10:03:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:59,074 INFO L225 Difference]: With dead ends: 215 [2025-02-08 10:03:59,074 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 10:03:59,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 10:03:59,075 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:59,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 405 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 10:03:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 10:03:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2025-02-08 10:03:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 117 states have (on average 1.7008547008547008) internal successors, (199), 199 states have internal predecessors, (199), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:03:59,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 221 transitions. [2025-02-08 10:03:59,085 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 221 transitions. Word has length 7 [2025-02-08 10:03:59,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:59,085 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 221 transitions. [2025-02-08 10:03:59,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 10:03:59,085 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 221 transitions. [2025-02-08 10:03:59,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-08 10:03:59,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:59,086 INFO L218 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] [2025-02-08 10:03:59,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 10:03:59,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:59,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_36_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_36_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 90 more)] === [2025-02-08 10:03:59,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1105400026, now seen corresponding path program 1 times [2025-02-08 10:03:59,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:59,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594127445] [2025-02-08 10:03:59,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:59,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:59,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:03:59,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:03:59,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:59,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-08 10:03:59,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462444995] [2025-02-08 10:03:59,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:59,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:59,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 10:03:59,345 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 10:03:59,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 10:03:59,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-08 10:03:59,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-08 10:03:59,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:59,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:03:59,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 10:03:59,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 10:03:59,440 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-02-08 10:03:59,525 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-02-08 10:03:59,531 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 10:03:59,531 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 10:03:59,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:03:59,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594127445] [2025-02-08 10:03:59,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-08 10:03:59,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462444995] [2025-02-08 10:03:59,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462444995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:03:59,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:03:59,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 10:03:59,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831809656] [2025-02-08 10:03:59,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:03:59,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 10:03:59,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:03:59,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 10:03:59,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 10:03:59,533 INFO L87 Difference]: Start difference. First operand 213 states and 221 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:03:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:03:59,617 INFO L93 Difference]: Finished difference Result 213 states and 221 transitions. [2025-02-08 10:03:59,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 10:03:59,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-08 10:03:59,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:03:59,618 INFO L225 Difference]: With dead ends: 213 [2025-02-08 10:03:59,618 INFO L226 Difference]: Without dead ends: 212 [2025-02-08 10:03:59,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-08 10:03:59,619 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 203 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:03:59,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 589 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:03:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2025-02-08 10:03:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2025-02-08 10:03:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 117 states have (on average 1.6923076923076923) internal successors, (198), 198 states have internal predecessors, (198), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:03:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 220 transitions. [2025-02-08 10:03:59,635 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 220 transitions. Word has length 26 [2025-02-08 10:03:59,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:03:59,636 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 220 transitions. [2025-02-08 10:03:59,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 10:03:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 220 transitions. [2025-02-08 10:03:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-08 10:03:59,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:03:59,637 INFO L218 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] [2025-02-08 10:03:59,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 10:03:59,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 10:03:59,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_36_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_36_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 90 more)] === [2025-02-08 10:03:59,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:03:59,838 INFO L85 PathProgramCache]: Analyzing trace with hash 92337732, now seen corresponding path program 1 times [2025-02-08 10:03:59,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:03:59,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589381891] [2025-02-08 10:03:59,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:03:59,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:03:59,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 10:03:59,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 10:03:59,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:03:59,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 10:04:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 10:04:00,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 10:04:00,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589381891] [2025-02-08 10:04:00,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589381891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 10:04:00,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 10:04:00,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 10:04:00,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343615369] [2025-02-08 10:04:00,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 10:04:00,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 10:04:00,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 10:04:00,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 10:04:00,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 10:04:00,186 INFO L87 Difference]: Start difference. First operand 212 states and 220 transitions. Second operand has 7 states, 5 states have (on average 4.6) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-02-08 10:04:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 10:04:00,280 INFO L93 Difference]: Finished difference Result 212 states and 220 transitions. [2025-02-08 10:04:00,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 10:04:00,280 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 7 states have internal predecessors, (23), 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 27 [2025-02-08 10:04:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 10:04:00,283 INFO L225 Difference]: With dead ends: 212 [2025-02-08 10:04:00,283 INFO L226 Difference]: Without dead ends: 211 [2025-02-08 10:04:00,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 10:04:00,283 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 10:04:00,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1228 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 10:04:00,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-02-08 10:04:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2025-02-08 10:04:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 117 states have (on average 1.6837606837606838) internal successors, (197), 197 states have internal predecessors, (197), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-02-08 10:04:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 219 transitions. [2025-02-08 10:04:00,296 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 219 transitions. Word has length 27 [2025-02-08 10:04:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 10:04:00,296 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 219 transitions. [2025-02-08 10:04:00,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.6) internal successors, (23), 7 states have internal predecessors, (23), 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) [2025-02-08 10:04:00,296 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 219 transitions. [2025-02-08 10:04:00,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 10:04:00,297 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 10:04:00,297 INFO L218 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, 1, 1, 1] [2025-02-08 10:04:00,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 10:04:00,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_33_to_36_0Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_33_to_36_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_33_to_36_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 90 more)] === [2025-02-08 10:04:00,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 10:04:00,297 INFO L85 PathProgramCache]: Analyzing trace with hash -734320113, now seen corresponding path program 1 times [2025-02-08 10:04:00,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 10:04:00,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025439785] [2025-02-08 10:04:00,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 10:04:00,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 10:04:00,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 10:04:00,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 10:04:00,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 10:04:00,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat