./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_loop-simple/recursified_nested_1b.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:10:02,507 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:10:02,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:10:02,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:10:02,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:10:02,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:10:02,570 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:10:02,570 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:10:02,571 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:10:02,571 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:10:02,571 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:10:02,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:10:02,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:10:02,571 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:10:02,571 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:10:02,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:10:02,572 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:10:02,573 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:02,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:02,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:02,574 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:10:02,574 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:10:02,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:10:02,575 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:10:02,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:10:02,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:10:02,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:10:02,575 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 ! call(reach_error())) ) 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 -> 4b2397f02ca31d86bec1660af6a105f36402aae0113477a6332673f13a213eff [2025-01-09 04:10:02,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:10:02,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:10:02,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:10:02,796 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:10:02,796 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:10:02,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-01-09 04:10:04,074 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2059d84f9/5adf1b5fb3d84f228828213b76157203/FLAG40a9b0925 [2025-01-09 04:10:04,324 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:10:04,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c [2025-01-09 04:10:04,335 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2059d84f9/5adf1b5fb3d84f228828213b76157203/FLAG40a9b0925 [2025-01-09 04:10:04,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2059d84f9/5adf1b5fb3d84f228828213b76157203 [2025-01-09 04:10:04,350 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:10:04,351 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:10:04,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:04,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:10:04,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:10:04,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a31a317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04, skipping insertion in model container [2025-01-09 04:10:04,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,375 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:10:04,475 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c[1277,1290] [2025-01-09 04:10:04,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:04,484 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:10:04,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/recursified_loop-simple/recursified_nested_1b.c[1277,1290] [2025-01-09 04:10:04,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:10:04,503 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:10:04,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04 WrapperNode [2025-01-09 04:10:04,505 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:10:04,506 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:04,506 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:10:04,506 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:10:04,512 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,525 INFO L138 Inliner]: procedures = 12, calls = 18, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2025-01-09 04:10:04,526 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:10:04,527 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:10:04,527 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:10:04,527 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:10:04,532 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,541 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 2 writes are split as follows [0, 2]. [2025-01-09 04:10:04,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,546 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,547 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,549 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,550 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:10:04,551 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:10:04,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:10:04,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:10:04,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (1/1) ... [2025-01-09 04:10:04,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:10:04,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:04,579 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-09 04:10:04,586 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-09 04:10:04,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:10:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:10:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:10:04,602 INFO L130 BoogieDeclarations]: Found specification of procedure func_to_recursive_line_19_to_19_0 [2025-01-09 04:10:04,603 INFO L138 BoogieDeclarations]: Found implementation of procedure func_to_recursive_line_19_to_19_0 [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:10:04,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 04:10:04,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 04:10:04,660 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:10:04,662 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:10:04,728 INFO L? ?]: Removed 3 outVars from TransFormulas that were not future-live. [2025-01-09 04:10:04,728 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:10:04,733 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:10:04,734 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 04:10:04,734 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:04 BoogieIcfgContainer [2025-01-09 04:10:04,734 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:10:04,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:10:04,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:10:04,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:10:04,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:10:04" (1/3) ... [2025-01-09 04:10:04,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9f391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:04, skipping insertion in model container [2025-01-09 04:10:04,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:10:04" (2/3) ... [2025-01-09 04:10:04,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c9f391a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:10:04, skipping insertion in model container [2025-01-09 04:10:04,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:04" (3/3) ... [2025-01-09 04:10:04,741 INFO L128 eAbstractionObserver]: Analyzing ICFG recursified_nested_1b.c [2025-01-09 04:10:04,750 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:10:04,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG recursified_nested_1b.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:10:04,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:10:04,789 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;@853e515, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:10:04,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:10:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:10:04,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-01-09 04:10:04,795 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:04,796 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:04,796 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:04,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:04,799 INFO L85 PathProgramCache]: Analyzing trace with hash -238646374, now seen corresponding path program 1 times [2025-01-09 04:10:04,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:04,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285064696] [2025-01-09 04:10:04,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:04,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:04,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-09 04:10:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-09 04:10:04,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:04,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:05,186 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-09 04:10:05,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:05,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285064696] [2025-01-09 04:10:05,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285064696] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:10:05,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:10:05,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:10:05,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260454340] [2025-01-09 04:10:05,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:10:05,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:10:05,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:05,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:10:05,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:10:05,207 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:05,281 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-01-09 04:10:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:10:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-01-09 04:10:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:05,289 INFO L225 Difference]: With dead ends: 26 [2025-01-09 04:10:05,289 INFO L226 Difference]: Without dead ends: 14 [2025-01-09 04:10:05,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:10:05,293 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:05,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 38 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:05,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-01-09 04:10:05,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-01-09 04:10:05,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 10 states have internal predecessors, (10), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-09 04:10:05,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-01-09 04:10:05,321 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2025-01-09 04:10:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:05,321 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-01-09 04:10:05,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 04:10:05,322 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2025-01-09 04:10:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 04:10:05,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:05,323 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:05,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:10:05,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:05,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:05,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1470993118, now seen corresponding path program 1 times [2025-01-09 04:10:05,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:05,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94236141] [2025-01-09 04:10:05,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:05,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:05,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 04:10:05,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 04:10:05,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:05,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:10:05,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94236141] [2025-01-09 04:10:05,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94236141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:05,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869918228] [2025-01-09 04:10:05,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:10:05,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:05,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:05,681 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-09 04:10:05,692 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-09 04:10:05,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 04:10:05,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 04:10:05,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:05,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:05,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 04:10:05,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:05,766 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-09 04:10:05,795 WARN L873 $PredicateComparison]: unable to prove that (exists ((func_to_recursive_line_19_to_19_0_~a.offset Int)) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |c_func_to_recursive_line_19_to_19_0_#in~a.base| (let ((.cse0 (select |c_old(#memory_int#1)| |c_func_to_recursive_line_19_to_19_0_#in~a.base|))) (store .cse0 func_to_recursive_line_19_to_19_0_~a.offset (+ (select .cse0 func_to_recursive_line_19_to_19_0_~a.offset) 1)))))) is different from true [2025-01-09 04:10:05,837 INFO L349 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2025-01-09 04:10:05,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 32 [2025-01-09 04:10:05,867 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 23 treesize of output 11 [2025-01-09 04:10:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2025-01-09 04:10:05,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869918228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:05,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2025-01-09 04:10:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249480292] [2025-01-09 04:10:05,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 04:10:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:05,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 04:10:05,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=172, Unknown=1, NotChecked=26, Total=240 [2025-01-09 04:10:05,965 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:10:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:06,092 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2025-01-09 04:10:06,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 04:10:06,093 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2025-01-09 04:10:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:06,093 INFO L225 Difference]: With dead ends: 20 [2025-01-09 04:10:06,094 INFO L226 Difference]: Without dead ends: 16 [2025-01-09 04:10:06,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=281, Unknown=1, NotChecked=34, Total=380 [2025-01-09 04:10:06,094 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:06,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 59 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2025-01-09 04:10:06,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-01-09 04:10:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2025-01-09 04:10:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 04:10:06,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2025-01-09 04:10:06,098 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 15 [2025-01-09 04:10:06,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:06,098 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-01-09 04:10:06,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-01-09 04:10:06,098 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2025-01-09 04:10:06,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 04:10:06,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:06,098 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:06,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:10:06,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:06,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:06,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:06,299 INFO L85 PathProgramCache]: Analyzing trace with hash 109140884, now seen corresponding path program 2 times [2025-01-09 04:10:06,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:06,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957933427] [2025-01-09 04:10:06,300 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:06,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:06,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 04:10:06,313 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 04:10:06,313 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:06,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:10:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957933427] [2025-01-09 04:10:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957933427] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028139439] [2025-01-09 04:10:06,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 04:10:06,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:06,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:06,630 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-09 04:10:06,631 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-09 04:10:06,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-01-09 04:10:06,666 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 04:10:06,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 04:10:06,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:06,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-01-09 04:10:06,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:06,672 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-09 04:10:06,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2025-01-09 04:10:06,776 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:10:06,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:07,007 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 7 treesize of output 3 [2025-01-09 04:10:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028139439] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:07,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 04:10:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 17 [2025-01-09 04:10:07,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918670254] [2025-01-09 04:10:07,120 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:07,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-01-09 04:10:07,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:07,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-01-09 04:10:07,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:10:07,121 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 04:10:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:07,174 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2025-01-09 04:10:07,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 04:10:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 20 [2025-01-09 04:10:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:07,174 INFO L225 Difference]: With dead ends: 26 [2025-01-09 04:10:07,174 INFO L226 Difference]: Without dead ends: 20 [2025-01-09 04:10:07,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2025-01-09 04:10:07,175 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:07,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:10:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-09 04:10:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-09 04:10:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-09 04:10:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2025-01-09 04:10:07,179 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 20 [2025-01-09 04:10:07,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:07,180 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2025-01-09 04:10:07,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 15 states have internal predecessors, (20), 5 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-09 04:10:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2025-01-09 04:10:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-01-09 04:10:07,180 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:07,180 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:07,187 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-09 04:10:07,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:07,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:07,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:07,386 INFO L85 PathProgramCache]: Analyzing trace with hash 242710158, now seen corresponding path program 3 times [2025-01-09 04:10:07,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:07,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683457753] [2025-01-09 04:10:07,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:07,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:07,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-01-09 04:10:07,403 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 04:10:07,403 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 04:10:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:07,927 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-09 04:10:07,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:10:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683457753] [2025-01-09 04:10:07,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683457753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:10:07,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847383962] [2025-01-09 04:10:07,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 04:10:07,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:07,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:10:07,931 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-09 04:10:07,933 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-09 04:10:07,961 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 30 statements into 5 equivalence classes. [2025-01-09 04:10:07,978 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 04:10:07,978 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 04:10:07,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:10:07,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 04:10:07,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:10:07,987 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-09 04:10:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 04:10:08,202 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 04:10:09,524 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 04:10:09,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847383962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 04:10:09,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 04:10:09,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 22] total 41 [2025-01-09 04:10:09,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500955866] [2025-01-09 04:10:09,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 04:10:09,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 04:10:09,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:10:09,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 04:10:09,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 04:10:09,527 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 41 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 12 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 04:10:09,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:10:09,923 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-01-09 04:10:09,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 04:10:09,924 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 12 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) Word has length 30 [2025-01-09 04:10:09,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:10:09,924 INFO L225 Difference]: With dead ends: 35 [2025-01-09 04:10:09,924 INFO L226 Difference]: Without dead ends: 29 [2025-01-09 04:10:09,926 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 852 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=505, Invalid=2251, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 04:10:09,926 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:10:09,926 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 143 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 04:10:09,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-01-09 04:10:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-01-09 04:10:09,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:10:09,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2025-01-09 04:10:09,935 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 30 [2025-01-09 04:10:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:10:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2025-01-09 04:10:09,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 11 states have call successors, (11), 6 states have call predecessors, (11), 12 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2025-01-09 04:10:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2025-01-09 04:10:09,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 04:10:09,938 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:10:09,938 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:10:09,945 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-09 04:10:10,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:10:10,143 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:10:10,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:10:10,145 INFO L85 PathProgramCache]: Analyzing trace with hash -484615032, now seen corresponding path program 4 times [2025-01-09 04:10:10,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:10:10,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884096000] [2025-01-09 04:10:10,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 04:10:10,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:10:10,155 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 40 statements into 2 equivalence classes. [2025-01-09 04:10:10,179 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:10:10,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 04:10:10,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:10:10,179 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 04:10:10,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 04:10:10,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 04:10:10,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:10:10,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 04:10:10,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 04:10:10,217 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 04:10:10,222 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 04:10:10,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 04:10:10,225 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1] [2025-01-09 04:10:10,249 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 04:10:10,250 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 04:10:10 BoogieIcfgContainer [2025-01-09 04:10:10,250 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 04:10:10,251 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 04:10:10,251 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 04:10:10,251 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 04:10:10,251 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:10:04" (3/4) ... [2025-01-09 04:10:10,252 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 04:10:10,304 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 23. [2025-01-09 04:10:10,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 04:10:10,380 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 04:10:10,380 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 04:10:10,385 INFO L158 Benchmark]: Toolchain (without parser) took 6029.60ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 133.3MB in the beginning and 81.9MB in the end (delta: 51.4MB). Peak memory consumption was 81.6MB. Max. memory is 16.1GB. [2025-01-09 04:10:10,385 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:10:10,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 149.00ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 122.6MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:10:10,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.35ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 121.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:10:10,385 INFO L158 Benchmark]: Boogie Preprocessor took 23.83ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 04:10:10,386 INFO L158 Benchmark]: RCFGBuilder took 183.24ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 110.3MB in the end (delta: 9.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 04:10:10,386 INFO L158 Benchmark]: TraceAbstraction took 5515.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 109.9MB in the beginning and 88.1MB in the end (delta: 21.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. [2025-01-09 04:10:10,386 INFO L158 Benchmark]: Witness Printer took 129.38ms. Allocated memory is still 201.3MB. Free memory was 88.1MB in the beginning and 81.9MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 04:10:10,387 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 149.00ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 122.6MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.35ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 121.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.83ms. Allocated memory is still 167.8MB. Free memory was 121.5MB in the beginning and 120.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 183.24ms. Allocated memory is still 167.8MB. Free memory was 120.2MB in the beginning and 110.3MB in the end (delta: 9.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5515.04ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 109.9MB in the beginning and 88.1MB in the end (delta: 21.8MB). Peak memory consumption was 48.1MB. Max. memory is 16.1GB. * Witness Printer took 129.38ms. Allocated memory is still 201.3MB. Free memory was 88.1MB in the beginning and 81.9MB in the end (delta: 6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 48]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L41] int a = 6; [L41] int a = 6; [L43] a = 0 [L44] CALL func_to_recursive_line_19_to_19_0(&a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND TRUE (*a) < 6 [L30] EXPR \read(*a) [L30] ++(*a) [L30] ++(*a) [L32] CALL func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}] [L25] EXPR \read(*a) VAL [\old(a)={7:0}, a={7:0}] [L25] COND FALSE !((*a) < 6) [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L32] RET func_to_recursive_line_19_to_19_0(a) VAL [\old(a)={7:0}, a={7:0}] [L44] RET func_to_recursive_line_19_to_19_0(&a) VAL [a={7:0}] [L46] EXPR \read(a) [L46] COND TRUE a == 6 [L48] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 5, TraceHistogramMax: 7, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 14 IncrementalHoareTripleChecker+Unchecked, 245 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 45 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1053 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 162 ConstructedInterpolants, 3 QuantifiedInterpolants, 1562 SizeOfPredicates, 23 NumberOfNonLiveVariables, 310 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 8 InterpolantComputations, 1 PerfectInterpolantSequences, 50/172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 04:10:10,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE