./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i -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 3bdf6e87ddd4e3fa9d4912c40adec3bde1bcd5c66861b555d5b25f0cfae6651f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:09:25,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:09:25,820 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:09:25,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:09:25,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:09:25,849 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:09:25,850 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:09:25,850 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:09:25,850 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:09:25,850 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:09:25,851 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:09:25,851 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:09:25,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:09:25,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:09:25,851 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:09:25,852 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:09:25,852 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:09:25,852 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:09:25,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:09:25,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:09:25,852 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:09:25,852 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:09:25,853 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:09:25,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:09:25,854 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:09:25,854 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:09:25,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:09:25,855 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 -> 3bdf6e87ddd4e3fa9d4912c40adec3bde1bcd5c66861b555d5b25f0cfae6651f [2025-02-06 01:09:26,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:09:26,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:09:26,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:09:26,100 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:09:26,100 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:09:26,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i [2025-02-06 01:09:27,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ab575129/53e3ea897a8b41c2bfe922981e147b20/FLAGfea9a093c [2025-02-06 01:09:27,565 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:09:27,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i [2025-02-06 01:09:27,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ab575129/53e3ea897a8b41c2bfe922981e147b20/FLAGfea9a093c [2025-02-06 01:09:27,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0ab575129/53e3ea897a8b41c2bfe922981e147b20 [2025-02-06 01:09:27,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:09:27,586 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:09:27,587 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:09:27,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:09:27,591 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:09:27,592 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,592 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b32f2e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27, skipping insertion in model container [2025-02-06 01:09:27,592 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:09:27,703 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i[915,928] [2025-02-06 01:09:27,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:09:27,738 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:09:27,745 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/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-25.i[915,928] [2025-02-06 01:09:27,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:09:27,773 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:09:27,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27 WrapperNode [2025-02-06 01:09:27,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:09:27,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:09:27,776 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:09:27,776 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:09:27,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,787 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,805 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2025-02-06 01:09:27,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:09:27,806 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:09:27,806 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:09:27,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:09:27,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,813 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,823 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 01:09:27,823 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,823 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,826 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,829 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:09:27,831 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:09:27,831 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:09:27,831 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:09:27,831 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (1/1) ... [2025-02-06 01:09:27,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:09:27,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:09:27,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 01:09:27,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 01:09:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:09:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:09:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:09:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:09:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:09:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:09:27,944 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:09:27,945 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:09:28,151 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-02-06 01:09:28,151 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:09:28,158 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:09:28,159 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:09:28,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:28 BoogieIcfgContainer [2025-02-06 01:09:28,160 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:09:28,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:09:28,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:09:28,165 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:09:28,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:09:27" (1/3) ... [2025-02-06 01:09:28,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca5c452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:28, skipping insertion in model container [2025-02-06 01:09:28,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:09:27" (2/3) ... [2025-02-06 01:09:28,166 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ca5c452 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:09:28, skipping insertion in model container [2025-02-06 01:09:28,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:28" (3/3) ... [2025-02-06 01:09:28,167 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-25.i [2025-02-06 01:09:28,177 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:09:28,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_25-1loop_file-25.i that has 2 procedures, 57 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:09:28,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:09:28,231 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;@4f7dc231, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:09:28,231 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:09:28,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:09:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 01:09:28,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:28,248 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:28,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:28,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:28,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1911768412, now seen corresponding path program 1 times [2025-02-06 01:09:28,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:28,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27956033] [2025-02-06 01:09:28,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:28,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:09:28,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:09:28,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:28,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 01:09:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:28,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27956033] [2025-02-06 01:09:28,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27956033] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:09:28,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802523753] [2025-02-06 01:09:28,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:28,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:09:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:09:28,510 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:09:28,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 01:09:28,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:09:28,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:09:28,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:28,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:28,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:09:28,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-02-06 01:09:28,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802523753] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:09:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:09:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940670522] [2025-02-06 01:09:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:09:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:28,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:09:28,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:09:28,726 INFO L87 Difference]: Start difference. First operand has 57 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 32 states have internal predecessors, (39), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:09:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:28,755 INFO L93 Difference]: Finished difference Result 111 states and 190 transitions. [2025-02-06 01:09:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:09:28,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2025-02-06 01:09:28,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:28,763 INFO L225 Difference]: With dead ends: 111 [2025-02-06 01:09:28,763 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 01:09:28,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:09:28,767 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:28,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:09:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 01:09:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-02-06 01:09:28,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-02-06 01:09:28,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2025-02-06 01:09:28,798 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 139 [2025-02-06 01:09:28,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:28,799 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2025-02-06 01:09:28,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-02-06 01:09:28,799 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2025-02-06 01:09:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 01:09:28,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:28,802 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:28,808 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-02-06 01:09:29,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:09:29,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:29,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:29,003 INFO L85 PathProgramCache]: Analyzing trace with hash 627930941, now seen corresponding path program 1 times [2025-02-06 01:09:29,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:29,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691517137] [2025-02-06 01:09:29,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:29,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:29,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:09:29,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:09:29,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:29,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 01:09:31,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:31,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691517137] [2025-02-06 01:09:31,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691517137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:09:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587145535] [2025-02-06 01:09:31,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:31,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:09:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:31,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:09:31,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:09:31,595 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:32,675 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-06 01:09:32,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:09:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-02-06 01:09:32,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:32,678 INFO L225 Difference]: With dead ends: 90 [2025-02-06 01:09:32,680 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 01:09:32,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-02-06 01:09:32,681 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 44 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:32,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 488 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 01:09:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 01:09:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2025-02-06 01:09:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 01:09:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 103 transitions. [2025-02-06 01:09:32,718 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 103 transitions. Word has length 139 [2025-02-06 01:09:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:32,718 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 103 transitions. [2025-02-06 01:09:32,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:32,718 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 103 transitions. [2025-02-06 01:09:32,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 01:09:32,719 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:32,720 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:32,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:09:32,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 628854462, now seen corresponding path program 1 times [2025-02-06 01:09:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:32,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182880300] [2025-02-06 01:09:32,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:32,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:09:32,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:09:32,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:32,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 01:09:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:36,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182880300] [2025-02-06 01:09:36,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182880300] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:36,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:36,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:09:36,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387637879] [2025-02-06 01:09:36,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:36,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:09:36,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:36,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:09:36,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:09:36,105 INFO L87 Difference]: Start difference. First operand 72 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:37,615 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2025-02-06 01:09:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:09:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-02-06 01:09:37,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:37,619 INFO L225 Difference]: With dead ends: 87 [2025-02-06 01:09:37,621 INFO L226 Difference]: Without dead ends: 85 [2025-02-06 01:09:37,621 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:09:37,622 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 25 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:37,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 337 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:09:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-02-06 01:09:37,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2025-02-06 01:09:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 01:09:37,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2025-02-06 01:09:37,637 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 139 [2025-02-06 01:09:37,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:37,638 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2025-02-06 01:09:37,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:37,638 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2025-02-06 01:09:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 01:09:37,639 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:37,640 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:37,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:09:37,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:37,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:37,640 INFO L85 PathProgramCache]: Analyzing trace with hash 656560092, now seen corresponding path program 1 times [2025-02-06 01:09:37,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:37,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227734757] [2025-02-06 01:09:37,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:37,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:37,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:09:37,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:09:37,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:37,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 01:09:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227734757] [2025-02-06 01:09:39,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227734757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:39,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:39,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:09:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726323614] [2025-02-06 01:09:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:39,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:09:39,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:39,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:09:39,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:09:39,082 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:40,091 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2025-02-06 01:09:40,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:09:40,092 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-02-06 01:09:40,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:40,093 INFO L225 Difference]: With dead ends: 103 [2025-02-06 01:09:40,093 INFO L226 Difference]: Without dead ends: 101 [2025-02-06 01:09:40,093 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:09:40,094 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 38 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:40,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 355 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 01:09:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-06 01:09:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2025-02-06 01:09:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 01:09:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2025-02-06 01:09:40,110 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 139 [2025-02-06 01:09:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:40,110 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2025-02-06 01:09:40,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2025-02-06 01:09:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-02-06 01:09:40,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:40,112 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:40,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:09:40,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:40,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash 657483613, now seen corresponding path program 1 times [2025-02-06 01:09:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141676781] [2025-02-06 01:09:40,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:40,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:40,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 01:09:40,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 01:09:40,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:40,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 01:09:41,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:41,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141676781] [2025-02-06 01:09:41,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141676781] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:41,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:41,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:09:41,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120404855] [2025-02-06 01:09:41,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:41,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:09:41,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:41,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:09:41,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:09:41,779 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:42,412 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2025-02-06 01:09:42,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:09:42,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2025-02-06 01:09:42,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:42,414 INFO L225 Difference]: With dead ends: 90 [2025-02-06 01:09:42,415 INFO L226 Difference]: Without dead ends: 88 [2025-02-06 01:09:42,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:09:42,415 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 16 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:42,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 298 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:09:42,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-02-06 01:09:42,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2025-02-06 01:09:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-02-06 01:09:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2025-02-06 01:09:42,431 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 139 [2025-02-06 01:09:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:42,431 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2025-02-06 01:09:42,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:42,432 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2025-02-06 01:09:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-02-06 01:09:42,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:42,433 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 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, 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-02-06 01:09:42,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:09:42,433 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:42,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:42,434 INFO L85 PathProgramCache]: Analyzing trace with hash -240370711, now seen corresponding path program 1 times [2025-02-06 01:09:42,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:42,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408703724] [2025-02-06 01:09:42,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:42,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:42,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 01:09:42,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 01:09:42,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:42,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:42,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-02-06 01:09:42,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:42,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408703724] [2025-02-06 01:09:42,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408703724] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:42,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:09:42,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:09:42,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171698049] [2025-02-06 01:09:42,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:42,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:09:42,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:42,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:09:42,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:09:42,554 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:42,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:42,671 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2025-02-06 01:09:42,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:09:42,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2025-02-06 01:09:42,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:42,675 INFO L225 Difference]: With dead ends: 208 [2025-02-06 01:09:42,675 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 01:09:42,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:09:42,676 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:42,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 223 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:09:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 01:09:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2025-02-06 01:09:42,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-02-06 01:09:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2025-02-06 01:09:42,706 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 140 [2025-02-06 01:09:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:42,707 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2025-02-06 01:09:42,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-02-06 01:09:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2025-02-06 01:09:42,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-02-06 01:09:42,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:09:42,711 INFO L218 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:42,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:09:42,711 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:09:42,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:09:42,712 INFO L85 PathProgramCache]: Analyzing trace with hash -890831032, now seen corresponding path program 1 times [2025-02-06 01:09:42,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:09:42,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37984736] [2025-02-06 01:09:42,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:42,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:09:42,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-06 01:09:42,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-06 01:09:42,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:42,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:42,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4183 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2025-02-06 01:09:42,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:09:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37984736] [2025-02-06 01:09:42,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37984736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:09:42,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666498583] [2025-02-06 01:09:42,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:09:42,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:09:42,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:09:42,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:09:42,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 01:09:42,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-02-06 01:09:42,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-02-06 01:09:42,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:09:42,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:09:42,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 01:09:42,940 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:09:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4183 backedges. 2159 proven. 0 refuted. 0 times theorem prover too weak. 2024 trivial. 0 not checked. [2025-02-06 01:09:43,082 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:09:43,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666498583] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:09:43,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:09:43,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-02-06 01:09:43,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897086495] [2025-02-06 01:09:43,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:09:43,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:09:43,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:09:43,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:09:43,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:09:43,083 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-06 01:09:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:09:43,148 INFO L93 Difference]: Finished difference Result 174 states and 252 transitions. [2025-02-06 01:09:43,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:09:43,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 276 [2025-02-06 01:09:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:09:43,150 INFO L225 Difference]: With dead ends: 174 [2025-02-06 01:09:43,150 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 01:09:43,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:09:43,151 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 2 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:09:43,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:09:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 01:09:43,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 01:09:43,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 01:09:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 01:09:43,152 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2025-02-06 01:09:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:09:43,152 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 01:09:43,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2025-02-06 01:09:43,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 01:09:43,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 01:09:43,159 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-06 01:09:43,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 01:09:43,361 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-02-06 01:09:43,364 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-06 01:09:43,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-06 01:09:43,622 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 01:09:43,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 01:09:43 BoogieIcfgContainer [2025-02-06 01:09:43,634 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 01:09:43,634 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 01:09:43,634 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 01:09:43,634 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 01:09:43,635 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:09:28" (3/4) ... [2025-02-06 01:09:43,637 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 01:09:43,642 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-02-06 01:09:43,649 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-02-06 01:09:43,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 01:09:43,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 01:09:43,650 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 01:09:43,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 01:09:43,716 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 01:09:43,717 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 01:09:43,718 INFO L158 Benchmark]: Toolchain (without parser) took 16131.18ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 112.1MB in the beginning and 243.9MB in the end (delta: -131.8MB). Peak memory consumption was 68.6MB. Max. memory is 16.1GB. [2025-02-06 01:09:43,718 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:09:43,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.45ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 99.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:09:43,721 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.19ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:09:43,721 INFO L158 Benchmark]: Boogie Preprocessor took 24.31ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 01:09:43,722 INFO L158 Benchmark]: IcfgBuilder took 329.29ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 78.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 01:09:43,722 INFO L158 Benchmark]: TraceAbstraction took 15472.23ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 77.8MB in the beginning and 248.3MB in the end (delta: -170.4MB). Peak memory consumption was 161.9MB. Max. memory is 16.1GB. [2025-02-06 01:09:43,722 INFO L158 Benchmark]: Witness Printer took 82.40ms. Allocated memory is still 343.9MB. Free memory was 248.3MB in the beginning and 243.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 01:09:43,723 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.17ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 188.45ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 99.1MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.19ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.3MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.31ms. Allocated memory is still 142.6MB. Free memory was 97.3MB in the beginning and 95.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 329.29ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 78.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 15472.23ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 77.8MB in the beginning and 248.3MB in the end (delta: -170.4MB). Peak memory consumption was 161.9MB. Max. memory is 16.1GB. * Witness Printer took 82.40ms. Allocated memory is still 343.9MB. Free memory was 248.3MB in the beginning and 243.9MB in the end (delta: 4.4MB). 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.2s, OverallIterations: 7, TraceHistogramMax: 46, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 1905 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1348 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 414 IncrementalHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 557 mSDtfsCounter, 414 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 478 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=6, 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 80 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 1526 NumberOfCodeBlocks, 1526 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1517 ConstructedInterpolants, 0 QuantifiedInterpolants, 3535 SizeOfPredicates, 0 NumberOfNonLiveVariables, 882 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 15405/15450 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 107]: Location Invariant Derived location invariant: (((var_1_6 == 0) && (k_loop == 0)) || (0 < k_loop)) RESULT: Ultimate proved your program to be correct! [2025-02-06 01:09:43,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE