./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 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_cohencu.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 ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 02:34:47,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 02:34:47,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 02:34:47,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 02:34:47,951 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 02:34:47,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 02:34:47,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 02:34:47,974 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 02:34:47,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 02:34:47,974 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 02:34:47,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 02:34:47,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 02:34:47,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 02:34:47,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 02:34:47,975 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 02:34:47,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 02:34:47,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 02:34:47,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 02:34:47,976 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 02:34:47,977 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:47,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:47,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:47,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 02:34:47,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 02:34:47,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 02:34:47,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 02:34:47,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 02:34:47,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 02:34:47,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 02:34:47,979 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 -> ab365eb388b6073fe9b18a07d6de0f6e90e5d145e13f5e07857ef91530e5178e [2025-01-10 02:34:48,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 02:34:48,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 02:34:48,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 02:34:48,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 02:34:48,292 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 02:34:48,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-01-10 02:34:49,568 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eba6fcad/4dfd2891d6e1480cbd725c6eaaad7085/FLAGde97fa780 [2025-01-10 02:34:49,867 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 02:34:49,868 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_nla-digbench/recursified_cohencu.c [2025-01-10 02:34:49,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eba6fcad/4dfd2891d6e1480cbd725c6eaaad7085/FLAGde97fa780 [2025-01-10 02:34:50,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4eba6fcad/4dfd2891d6e1480cbd725c6eaaad7085 [2025-01-10 02:34:50,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 02:34:50,139 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 02:34:50,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:50,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 02:34:50,144 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 02:34:50,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26b577b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50, skipping insertion in model container [2025-01-10 02:34:50,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 02:34:50,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:50,314 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 02:34:50,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 02:34:50,351 INFO L204 MainTranslator]: Completed translation [2025-01-10 02:34:50,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50 WrapperNode [2025-01-10 02:34:50,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 02:34:50,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:50,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 02:34:50,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 02:34:50,359 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,388 INFO L138 Inliner]: procedures = 16, calls = 100, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 197 [2025-01-10 02:34:50,393 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 02:34:50,393 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 02:34:50,393 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 02:34:50,393 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 02:34:50,402 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,439 INFO L175 MemorySlicer]: Split 66 memory accesses to 6 slices as follows [2, 12, 5, 11, 21, 15]. 32 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 9 writes are split as follows [0, 2, 1, 2, 2, 2]. [2025-01-10 02:34:50,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,467 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 02:34:50,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 02:34:50,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 02:34:50,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 02:34:50,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (1/1) ... [2025-01-10 02:34:50,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 02:34:50,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:50,509 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-01-10 02:34:50,517 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-01-10 02:34:50,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 02:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 02:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 02:34:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-10 02:34:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-10 02:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-10 02:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-10 02:34:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_27_to_39_0 [2025-01-10 02:34:50,540 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_27_to_39_0 [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 02:34:50,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-10 02:34:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-10 02:34:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-10 02:34:50,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-10 02:34:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-10 02:34:50,658 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 02:34:50,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 02:34:51,432 INFO L? ?]: Removed 357 outVars from TransFormulas that were not future-live. [2025-01-10 02:34:51,432 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 02:34:51,452 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 02:34:51,452 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-10 02:34:51,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:51 BoogieIcfgContainer [2025-01-10 02:34:51,453 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 02:34:51,455 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 02:34:51,455 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 02:34:51,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 02:34:51,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 02:34:50" (1/3) ... [2025-01-10 02:34:51,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c25bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:51, skipping insertion in model container [2025-01-10 02:34:51,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 02:34:50" (2/3) ... [2025-01-10 02:34:51,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38c25bf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 02:34:51, skipping insertion in model container [2025-01-10 02:34:51,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 02:34:51" (3/3) ... [2025-01-10 02:34:51,462 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_cohencu.c [2025-01-10 02:34:51,479 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 02:34:51,481 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_cohencu.c that has 3 procedures, 317 locations, 1 initial locations, 0 loop locations, and 138 error locations. [2025-01-10 02:34:51,553 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 02:34:51,564 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;@4e8f0b92, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 02:34:51,564 INFO L334 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2025-01-10 02:34:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-10 02:34:51,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-01-10 02:34:51,574 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:51,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 02:34:51,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:51,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:51,578 INFO L85 PathProgramCache]: Analyzing trace with hash 476001869, now seen corresponding path program 1 times [2025-01-10 02:34:51,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038282054] [2025-01-10 02:34:51,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:51,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:51,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 02:34:51,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 02:34:51,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:51,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:52,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:52,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:52,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038282054] [2025-01-10 02:34:52,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038282054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:52,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:52,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:52,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735526310] [2025-01-10 02:34:52,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:52,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:52,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:52,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:52,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:52,131 INFO L87 Difference]: Start difference. First operand has 317 states, 163 states have (on average 1.8650306748466257) internal successors, (304), 302 states have internal predecessors, (304), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:52,416 INFO L93 Difference]: Finished difference Result 738 states and 792 transitions. [2025-01-10 02:34:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:52,419 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-01-10 02:34:52,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:52,427 INFO L225 Difference]: With dead ends: 738 [2025-01-10 02:34:52,428 INFO L226 Difference]: Without dead ends: 418 [2025-01-10 02:34:52,432 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-01-10 02:34:52,435 INFO L435 NwaCegarLoop]: 311 mSDtfsCounter, 205 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:52,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 1530 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:34:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2025-01-10 02:34:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 371. [2025-01-10 02:34:52,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8497652582159625) internal successors, (394), 351 states have internal predecessors, (394), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-01-10 02:34:52,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 429 transitions. [2025-01-10 02:34:52,502 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 429 transitions. Word has length 6 [2025-01-10 02:34:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:52,502 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 429 transitions. [2025-01-10 02:34:52,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 02:34:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 429 transitions. [2025-01-10 02:34:52,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-10 02:34:52,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:52,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:52,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 02:34:52,504 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting func_to_recursive_line_27_to_39_0Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:52,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:52,505 INFO L85 PathProgramCache]: Analyzing trace with hash 13280284, now seen corresponding path program 1 times [2025-01-10 02:34:52,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:52,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308514052] [2025-01-10 02:34:52,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:52,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 02:34:52,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 02:34:52,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:52,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:52,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308514052] [2025-01-10 02:34:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308514052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976059683] [2025-01-10 02:34:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:52,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:52,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:52,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:52,743 INFO L87 Difference]: Start difference. First operand 371 states and 429 transitions. Second operand has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:52,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:52,926 INFO L93 Difference]: Finished difference Result 418 states and 434 transitions. [2025-01-10 02:34:52,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:52,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-10 02:34:52,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:52,929 INFO L225 Difference]: With dead ends: 418 [2025-01-10 02:34:52,930 INFO L226 Difference]: Without dead ends: 414 [2025-01-10 02:34:52,931 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-01-10 02:34:52,932 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 200 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1479 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:52,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1479 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:52,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-10 02:34:52,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 371. [2025-01-10 02:34:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8309859154929577) internal successors, (390), 351 states have internal predecessors, (390), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-01-10 02:34:52,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 425 transitions. [2025-01-10 02:34:52,969 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 425 transitions. Word has length 16 [2025-01-10 02:34:52,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:52,969 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 425 transitions. [2025-01-10 02:34:52,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 425 transitions. [2025-01-10 02:34:52,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-10 02:34:52,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:52,971 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:52,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 02:34:52,972 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting func_to_recursive_line_27_to_39_0Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:52,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:52,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1803988512, now seen corresponding path program 1 times [2025-01-10 02:34:52,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:52,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874719899] [2025-01-10 02:34:52,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:52,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:52,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-10 02:34:52,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-10 02:34:52,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:52,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:53,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:53,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874719899] [2025-01-10 02:34:53,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874719899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:53,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:53,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:53,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318933119] [2025-01-10 02:34:53,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:53,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:53,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:53,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:53,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:53,159 INFO L87 Difference]: Start difference. First operand 371 states and 425 transitions. Second operand has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:53,351 INFO L93 Difference]: Finished difference Result 414 states and 430 transitions. [2025-01-10 02:34:53,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:53,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2025-01-10 02:34:53,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:53,354 INFO L225 Difference]: With dead ends: 414 [2025-01-10 02:34:53,354 INFO L226 Difference]: Without dead ends: 412 [2025-01-10 02:34:53,355 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-01-10 02:34:53,355 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 186 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1481 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:53,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1481 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-01-10 02:34:53,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 371. [2025-01-10 02:34:53,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8215962441314555) internal successors, (388), 351 states have internal predecessors, (388), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-01-10 02:34:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 423 transitions. [2025-01-10 02:34:53,380 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 423 transitions. Word has length 20 [2025-01-10 02:34:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:53,381 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 423 transitions. [2025-01-10 02:34:53,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 423 transitions. [2025-01-10 02:34:53,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-10 02:34:53,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:53,382 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:53,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-10 02:34:53,382 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting func_to_recursive_line_27_to_39_0Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:53,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:53,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1533829314, now seen corresponding path program 1 times [2025-01-10 02:34:53,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:53,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137305569] [2025-01-10 02:34:53,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:53,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:53,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-10 02:34:53,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-10 02:34:53,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:53,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137305569] [2025-01-10 02:34:53,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137305569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:53,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:53,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297945404] [2025-01-10 02:34:53,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:53,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:53,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:53,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:53,572 INFO L87 Difference]: Start difference. First operand 371 states and 423 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, (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-01-10 02:34:53,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:53,776 INFO L93 Difference]: Finished difference Result 412 states and 428 transitions. [2025-01-10 02:34:53,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:34:53,776 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, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2025-01-10 02:34:53,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:53,778 INFO L225 Difference]: With dead ends: 412 [2025-01-10 02:34:53,779 INFO L226 Difference]: Without dead ends: 410 [2025-01-10 02:34:53,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:34:53,780 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 188 mSDsluCounter, 1251 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 1549 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:53,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 1549 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:53,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-01-10 02:34:53,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 371. [2025-01-10 02:34:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.812206572769953) internal successors, (386), 351 states have internal predecessors, (386), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-01-10 02:34:53,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 421 transitions. [2025-01-10 02:34:53,798 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 421 transitions. Word has length 22 [2025-01-10 02:34:53,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:53,798 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 421 transitions. [2025-01-10 02:34:53,799 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, (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-01-10 02:34:53,799 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 421 transitions. [2025-01-10 02:34:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-10 02:34:53,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:53,799 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 02:34:53,800 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting func_to_recursive_line_27_to_39_0Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 304068537, now seen corresponding path program 1 times [2025-01-10 02:34:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499152881] [2025-01-10 02:34:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:53,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 02:34:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 02:34:53,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:53,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:53,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 02:34:53,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:53,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499152881] [2025-01-10 02:34:53,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499152881] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:53,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:53,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:34:53,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694089162] [2025-01-10 02:34:53,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:53,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:34:53,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:53,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:34:53,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:34:53,997 INFO L87 Difference]: Start difference. First operand 371 states and 421 transitions. Second operand has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:54,161 INFO L93 Difference]: Finished difference Result 410 states and 426 transitions. [2025-01-10 02:34:54,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:34:54,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-01-10 02:34:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:54,164 INFO L225 Difference]: With dead ends: 410 [2025-01-10 02:34:54,164 INFO L226 Difference]: Without dead ends: 408 [2025-01-10 02:34:54,164 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-01-10 02:34:54,165 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 175 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:54,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1483 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-10 02:34:54,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-10 02:34:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 371. [2025-01-10 02:34:54,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 213 states have (on average 1.8028169014084507) internal successors, (384), 351 states have internal predecessors, (384), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (18), 17 states have call predecessors, (18), 17 states have call successors, (18) [2025-01-10 02:34:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 419 transitions. [2025-01-10 02:34:54,183 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 419 transitions. Word has length 23 [2025-01-10 02:34:54,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:54,183 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 419 transitions. [2025-01-10 02:34:54,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-10 02:34:54,183 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 419 transitions. [2025-01-10 02:34:54,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-10 02:34:54,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:54,184 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, 1] [2025-01-10 02:34:54,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 02:34:54,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting func_to_recursive_line_27_to_39_0Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:54,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,185 INFO L85 PathProgramCache]: Analyzing trace with hash 952671999, now seen corresponding path program 1 times [2025-01-10 02:34:54,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020143102] [2025-01-10 02:34:54,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:34:54,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:34:54,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:34:54,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758697334] [2025-01-10 02:34:54,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:54,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:54,220 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-01-10 02:34:54,222 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-01-10 02:34:54,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-10 02:34:54,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-10 02:34:54,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:54,321 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-01-10 02:34:54,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:54,366 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-01-10 02:34:54,520 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 02:34:54,521 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:54,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:54,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020143102] [2025-01-10 02:34:54,522 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:34:54,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758697334] [2025-01-10 02:34:54,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758697334] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:54,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:54,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:54,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761803655] [2025-01-10 02:34:54,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:54,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:54,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:54,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:54,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:54,524 INFO L87 Difference]: Start difference. First operand 371 states and 419 transitions. Second operand has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-01-10 02:34:54,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:34:54,737 INFO L93 Difference]: Finished difference Result 590 states and 609 transitions. [2025-01-10 02:34:54,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:34:54,738 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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 32 [2025-01-10 02:34:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:34:54,740 INFO L225 Difference]: With dead ends: 590 [2025-01-10 02:34:54,741 INFO L226 Difference]: Without dead ends: 586 [2025-01-10 02:34:54,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 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-01-10 02:34:54,741 INFO L435 NwaCegarLoop]: 300 mSDtfsCounter, 344 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:34:54,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1768 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:34:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2025-01-10 02:34:54,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 453. [2025-01-10 02:34:54,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8131487889273357) internal successors, (524), 427 states have internal predecessors, (524), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:34:54,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 569 transitions. [2025-01-10 02:34:54,766 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 569 transitions. Word has length 32 [2025-01-10 02:34:54,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:34:54,767 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 569 transitions. [2025-01-10 02:34:54,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 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-01-10 02:34:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 569 transitions. [2025-01-10 02:34:54,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-10 02:34:54,768 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:34:54,768 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, 1, 1, 1, 1, 1, 1] [2025-01-10 02:34:54,777 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-01-10 02:34:54,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:54,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting func_to_recursive_line_27_to_39_0Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:34:54,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:34:54,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1089407434, now seen corresponding path program 1 times [2025-01-10 02:34:54,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:34:54,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731215864] [2025-01-10 02:34:54,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:34:54,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:34:54,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:34:54,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:54,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:34:54,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306717229] [2025-01-10 02:34:54,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:34:54,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:34:54,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:34:54,999 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-01-10 02:34:55,002 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-01-10 02:34:55,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-10 02:34:55,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-10 02:34:55,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:34:55,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:34:55,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-10 02:34:55,110 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:34:55,131 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-01-10 02:34:55,136 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-01-10 02:34:55,477 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-01-10 02:34:55,485 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-01-10 02:34:55,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:34:55,499 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:34:55,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:34:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731215864] [2025-01-10 02:34:55,499 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:34:55,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306717229] [2025-01-10 02:34:55,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306717229] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:34:55,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:34:55,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:34:55,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345138204] [2025-01-10 02:34:55,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:34:55,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:34:55,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:34:55,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:34:55,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:34:55,501 INFO L87 Difference]: Start difference. First operand 453 states and 569 transitions. Second operand has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-01-10 02:34:59,700 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-01-10 02:35:03,825 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-01-10 02:35:07,835 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-01-10 02:35:11,840 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-01-10 02:35:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:11,905 INFO L93 Difference]: Finished difference Result 594 states and 613 transitions. [2025-01-10 02:35:11,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:35:11,905 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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 42 [2025-01-10 02:35:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:11,909 INFO L225 Difference]: With dead ends: 594 [2025-01-10 02:35:11,909 INFO L226 Difference]: Without dead ends: 593 [2025-01-10 02:35:11,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:35:11,910 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 361 mSDsluCounter, 1242 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 16 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:11,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1506 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 284 Invalid, 4 Unknown, 0 Unchecked, 16.3s Time] [2025-01-10 02:35:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2025-01-10 02:35:11,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 453. [2025-01-10 02:35:11,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.8096885813148789) internal successors, (523), 427 states have internal predecessors, (523), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 568 transitions. [2025-01-10 02:35:11,935 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 568 transitions. Word has length 42 [2025-01-10 02:35:11,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:11,936 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 568 transitions. [2025-01-10 02:35:11,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 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-01-10 02:35:11,936 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 568 transitions. [2025-01-10 02:35:11,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-10 02:35:11,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:11,937 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:11,946 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-01-10 02:35:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:12,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting func_to_recursive_line_27_to_39_0Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:12,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash 588107993, now seen corresponding path program 1 times [2025-01-10 02:35:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298828397] [2025-01-10 02:35:12,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:12,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:35:12,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:35:12,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:12,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:35:12,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389397045] [2025-01-10 02:35:12,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:12,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:12,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:12,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:35:12,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-10 02:35:12,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-10 02:35:12,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-10 02:35:12,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:12,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:12,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-10 02:35:12,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:12,298 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-01-10 02:35:12,303 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-01-10 02:35:12,669 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:12,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:12,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298828397] [2025-01-10 02:35:12,670 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:35:12,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389397045] [2025-01-10 02:35:12,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389397045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:12,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:12,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:35:12,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814663335] [2025-01-10 02:35:12,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:12,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:35:12,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:12,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:35:12,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:35:12,672 INFO L87 Difference]: Start difference. First operand 453 states and 568 transitions. Second operand has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-01-10 02:35:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:13,013 INFO L93 Difference]: Finished difference Result 593 states and 612 transitions. [2025-01-10 02:35:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:35:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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 43 [2025-01-10 02:35:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:13,016 INFO L225 Difference]: With dead ends: 593 [2025-01-10 02:35:13,016 INFO L226 Difference]: Without dead ends: 592 [2025-01-10 02:35:13,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-10 02:35:13,017 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 516 mSDsluCounter, 1074 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:13,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1339 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-10 02:35:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-10 02:35:13,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 453. [2025-01-10 02:35:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.806228373702422) internal successors, (522), 427 states have internal predecessors, (522), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 567 transitions. [2025-01-10 02:35:13,033 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 567 transitions. Word has length 43 [2025-01-10 02:35:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:13,034 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 567 transitions. [2025-01-10 02:35:13,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 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-01-10 02:35:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 567 transitions. [2025-01-10 02:35:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-10 02:35:13,037 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:13,038 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:13,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-10 02:35:13,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:13,239 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting func_to_recursive_line_27_to_39_0Err20ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:13,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:13,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1051478680, now seen corresponding path program 1 times [2025-01-10 02:35:13,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:13,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631391190] [2025-01-10 02:35:13,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:13,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:13,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 02:35:13,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 02:35:13,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:13,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:13,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:13,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:13,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631391190] [2025-01-10 02:35:13,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631391190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:13,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:13,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:35:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113010617] [2025-01-10 02:35:13,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:13,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:13,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:13,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:13,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:35:13,421 INFO L87 Difference]: Start difference. First operand 453 states and 567 transitions. Second operand has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-01-10 02:35:13,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:13,619 INFO L93 Difference]: Finished difference Result 560 states and 580 transitions. [2025-01-10 02:35:13,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:35:13,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 44 [2025-01-10 02:35:13,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:13,623 INFO L225 Difference]: With dead ends: 560 [2025-01-10 02:35:13,623 INFO L226 Difference]: Without dead ends: 558 [2025-01-10 02:35:13,623 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-01-10 02:35:13,624 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 313 mSDsluCounter, 1141 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:13,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1431 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:13,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2025-01-10 02:35:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 453. [2025-01-10 02:35:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7993079584775087) internal successors, (520), 427 states have internal predecessors, (520), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 565 transitions. [2025-01-10 02:35:13,656 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 565 transitions. Word has length 44 [2025-01-10 02:35:13,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:13,656 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 565 transitions. [2025-01-10 02:35:13,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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-01-10 02:35:13,657 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 565 transitions. [2025-01-10 02:35:13,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-10 02:35:13,657 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:13,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:13,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 02:35:13,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting func_to_recursive_line_27_to_39_0Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:13,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1153699578, now seen corresponding path program 1 times [2025-01-10 02:35:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825008592] [2025-01-10 02:35:13,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:13,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-10 02:35:13,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-10 02:35:13,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:13,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:13,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:13,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825008592] [2025-01-10 02:35:13,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825008592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:13,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-10 02:35:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534400934] [2025-01-10 02:35:13,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:13,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-10 02:35:13,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:13,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-10 02:35:13,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-10 02:35:13,869 INFO L87 Difference]: Start difference. First operand 453 states and 565 transitions. Second operand has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-01-10 02:35:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:14,141 INFO L93 Difference]: Finished difference Result 558 states and 578 transitions. [2025-01-10 02:35:14,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-10 02:35:14,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 46 [2025-01-10 02:35:14,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:14,145 INFO L225 Difference]: With dead ends: 558 [2025-01-10 02:35:14,145 INFO L226 Difference]: Without dead ends: 557 [2025-01-10 02:35:14,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 02:35:14,147 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 309 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1695 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:14,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1695 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:14,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2025-01-10 02:35:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 453. [2025-01-10 02:35:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7958477508650519) internal successors, (519), 427 states have internal predecessors, (519), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:14,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 564 transitions. [2025-01-10 02:35:14,178 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 564 transitions. Word has length 46 [2025-01-10 02:35:14,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:14,178 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 564 transitions. [2025-01-10 02:35:14,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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-01-10 02:35:14,178 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 564 transitions. [2025-01-10 02:35:14,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-10 02:35:14,179 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:14,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:14,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 02:35:14,179 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting func_to_recursive_line_27_to_39_0Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:14,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1404948637, now seen corresponding path program 1 times [2025-01-10 02:35:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765622646] [2025-01-10 02:35:14,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:14,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:14,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-10 02:35:14,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-10 02:35:14,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:14,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:14,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:14,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765622646] [2025-01-10 02:35:14,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765622646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:14,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:14,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:35:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129324013] [2025-01-10 02:35:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:14,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:14,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:14,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:14,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:35:14,357 INFO L87 Difference]: Start difference. First operand 453 states and 564 transitions. Second operand has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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-01-10 02:35:14,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:14,639 INFO L93 Difference]: Finished difference Result 557 states and 577 transitions. [2025-01-10 02:35:14,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:35:14,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 47 [2025-01-10 02:35:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:14,642 INFO L225 Difference]: With dead ends: 557 [2025-01-10 02:35:14,642 INFO L226 Difference]: Without dead ends: 556 [2025-01-10 02:35:14,643 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-01-10 02:35:14,643 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 306 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:14,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 1431 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:14,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-10 02:35:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 453. [2025-01-10 02:35:14,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.792387543252595) internal successors, (518), 427 states have internal predecessors, (518), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:14,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 563 transitions. [2025-01-10 02:35:14,658 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 563 transitions. Word has length 47 [2025-01-10 02:35:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:14,658 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 563 transitions. [2025-01-10 02:35:14,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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-01-10 02:35:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 563 transitions. [2025-01-10 02:35:14,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-01-10 02:35:14,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:14,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:14,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 02:35:14,659 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting func_to_recursive_line_27_to_39_0Err24ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:14,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:14,660 INFO L85 PathProgramCache]: Analyzing trace with hash 603734876, now seen corresponding path program 1 times [2025-01-10 02:35:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:14,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25711066] [2025-01-10 02:35:14,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:14,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:14,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-10 02:35:14,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-10 02:35:14,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:14,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25711066] [2025-01-10 02:35:14,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25711066] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:14,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:14,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:35:14,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19945146] [2025-01-10 02:35:14,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:14,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:14,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:35:14,822 INFO L87 Difference]: Start difference. First operand 453 states and 563 transitions. Second operand has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-01-10 02:35:15,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:15,025 INFO L93 Difference]: Finished difference Result 568 states and 588 transitions. [2025-01-10 02:35:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:35:15,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 48 [2025-01-10 02:35:15,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:15,028 INFO L225 Difference]: With dead ends: 568 [2025-01-10 02:35:15,028 INFO L226 Difference]: Without dead ends: 566 [2025-01-10 02:35:15,029 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-01-10 02:35:15,029 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 311 mSDsluCounter, 1133 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:15,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1423 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:15,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-01-10 02:35:15,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 453. [2025-01-10 02:35:15,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7854671280276817) internal successors, (516), 427 states have internal predecessors, (516), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:15,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 561 transitions. [2025-01-10 02:35:15,044 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 561 transitions. Word has length 48 [2025-01-10 02:35:15,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:15,045 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 561 transitions. [2025-01-10 02:35:15,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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-01-10 02:35:15,045 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 561 transitions. [2025-01-10 02:35:15,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-01-10 02:35:15,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:15,046 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:15,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 02:35:15,046 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting func_to_recursive_line_27_to_39_0Err26ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:15,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:15,047 INFO L85 PathProgramCache]: Analyzing trace with hash 368633790, now seen corresponding path program 1 times [2025-01-10 02:35:15,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:15,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510668522] [2025-01-10 02:35:15,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:15,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:35:15,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:35:15,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:15,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-10 02:35:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [403819911] [2025-01-10 02:35:15,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:15,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 02:35:15,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 02:35:15,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 02:35:15,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-10 02:35:15,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-10 02:35:15,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-10 02:35:15,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:15,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:15,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-01-10 02:35:15,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 02:35:15,186 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-01-10 02:35:15,194 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-01-10 02:35:15,552 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-01-10 02:35:15,583 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-01-10 02:35:15,653 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-01-10 02:35:15,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:15,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 02:35:15,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510668522] [2025-01-10 02:35:15,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-10 02:35:15,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [403819911] [2025-01-10 02:35:15,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [403819911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:15,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:15,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-10 02:35:15,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251567384] [2025-01-10 02:35:15,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:15,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 02:35:15,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:15,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 02:35:15,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-01-10 02:35:15,720 INFO L87 Difference]: Start difference. First operand 453 states and 561 transitions. Second operand has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 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-01-10 02:35:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:16,365 INFO L93 Difference]: Finished difference Result 582 states and 601 transitions. [2025-01-10 02:35:16,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-10 02:35:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 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 50 [2025-01-10 02:35:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:16,368 INFO L225 Difference]: With dead ends: 582 [2025-01-10 02:35:16,368 INFO L226 Difference]: Without dead ends: 581 [2025-01-10 02:35:16,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2025-01-10 02:35:16,369 INFO L435 NwaCegarLoop]: 267 mSDtfsCounter, 368 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:16,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 2268 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-10 02:35:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-10 02:35:16,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 453. [2025-01-10 02:35:16,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.782006920415225) internal successors, (515), 427 states have internal predecessors, (515), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 560 transitions. [2025-01-10 02:35:16,388 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 560 transitions. Word has length 50 [2025-01-10 02:35:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:16,390 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 560 transitions. [2025-01-10 02:35:16,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.111111111111111) internal successors, (37), 10 states have internal predecessors, (37), 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-01-10 02:35:16,390 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 560 transitions. [2025-01-10 02:35:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-01-10 02:35:16,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:16,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:16,399 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-10 02:35:16,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-10 02:35:16,595 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting func_to_recursive_line_27_to_39_0Err27ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:16,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:16,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1457254303, now seen corresponding path program 1 times [2025-01-10 02:35:16,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:16,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721461847] [2025-01-10 02:35:16,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:16,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-10 02:35:16,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-10 02:35:16,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:16,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:16,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:16,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:16,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721461847] [2025-01-10 02:35:16,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721461847] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:16,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:16,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:35:16,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915032360] [2025-01-10 02:35:16,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:16,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:16,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:16,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:16,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:35:16,754 INFO L87 Difference]: Start difference. First operand 453 states and 560 transitions. Second operand has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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-01-10 02:35:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:16,984 INFO L93 Difference]: Finished difference Result 565 states and 585 transitions. [2025-01-10 02:35:16,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:35:16,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 51 [2025-01-10 02:35:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:16,987 INFO L225 Difference]: With dead ends: 565 [2025-01-10 02:35:16,987 INFO L226 Difference]: Without dead ends: 564 [2025-01-10 02:35:16,987 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-01-10 02:35:16,988 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 304 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:16,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1416 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:16,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-01-10 02:35:17,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 453. [2025-01-10 02:35:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.778546712802768) internal successors, (514), 427 states have internal predecessors, (514), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 559 transitions. [2025-01-10 02:35:17,006 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 559 transitions. Word has length 51 [2025-01-10 02:35:17,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:17,006 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 559 transitions. [2025-01-10 02:35:17,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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-01-10 02:35:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 559 transitions. [2025-01-10 02:35:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-01-10 02:35:17,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:17,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:17,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 02:35:17,008 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting func_to_recursive_line_27_to_39_0Err28ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:17,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:17,009 INFO L85 PathProgramCache]: Analyzing trace with hash 2069756960, now seen corresponding path program 1 times [2025-01-10 02:35:17,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:17,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976436006] [2025-01-10 02:35:17,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:17,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:17,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-10 02:35:17,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-10 02:35:17,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:17,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 02:35:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-10 02:35:17,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 02:35:17,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976436006] [2025-01-10 02:35:17,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976436006] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 02:35:17,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 02:35:17,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 02:35:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804882757] [2025-01-10 02:35:17,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 02:35:17,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 02:35:17,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 02:35:17,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 02:35:17,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-10 02:35:17,185 INFO L87 Difference]: Start difference. First operand 453 states and 559 transitions. Second operand has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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-01-10 02:35:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 02:35:17,377 INFO L93 Difference]: Finished difference Result 576 states and 596 transitions. [2025-01-10 02:35:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 02:35:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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 52 [2025-01-10 02:35:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-10 02:35:17,379 INFO L225 Difference]: With dead ends: 576 [2025-01-10 02:35:17,380 INFO L226 Difference]: Without dead ends: 574 [2025-01-10 02:35:17,380 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-01-10 02:35:17,380 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 309 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-10 02:35:17,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 1416 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-10 02:35:17,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2025-01-10 02:35:17,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 453. [2025-01-10 02:35:17,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 289 states have (on average 1.7716262975778547) internal successors, (512), 427 states have internal predecessors, (512), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (23), 22 states have call predecessors, (23), 22 states have call successors, (23) [2025-01-10 02:35:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 557 transitions. [2025-01-10 02:35:17,394 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 557 transitions. Word has length 52 [2025-01-10 02:35:17,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-10 02:35:17,395 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 557 transitions. [2025-01-10 02:35:17,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 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-01-10 02:35:17,395 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 557 transitions. [2025-01-10 02:35:17,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-01-10 02:35:17,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-10 02:35:17,395 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 02:35:17,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 02:35:17,396 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting func_to_recursive_line_27_to_39_0Err30ASSERT_VIOLATIONINTEGER_OVERFLOW === [func_to_recursive_line_27_to_39_0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, func_to_recursive_line_27_to_39_0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 136 more)] === [2025-01-10 02:35:17,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 02:35:17,396 INFO L85 PathProgramCache]: Analyzing trace with hash 466583682, now seen corresponding path program 1 times [2025-01-10 02:35:17,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 02:35:17,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133132801] [2025-01-10 02:35:17,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 02:35:17,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 02:35:17,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-10 02:35:17,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-10 02:35:17,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 02:35:17,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat