./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem14_label07.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/eca-rers2012/Problem14_label07.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 56a04ed46850e605182228c8e81c7d165207799703ed3ae3590996aae38bb805 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:57:23,881 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:57:23,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:57:23,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:57:23,938 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:57:23,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:57:23,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:57:23,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:57:23,968 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:57:23,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:57:23,968 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:57:23,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:57:23,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:57:23,969 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:23,969 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:23,969 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:57:23,969 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:57:23,970 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:57:23,970 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 -> 56a04ed46850e605182228c8e81c7d165207799703ed3ae3590996aae38bb805 [2025-01-08 23:57:24,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:57:24,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:57:24,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:57:24,178 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:57:24,178 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:57:24,179 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem14_label07.c [2025-01-08 23:57:25,310 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e06ec4dad/61c952ef339e438d8ce40dd50f32eb5b/FLAGc4574e2c9 [2025-01-08 23:57:25,623 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:57:25,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label07.c [2025-01-08 23:57:25,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e06ec4dad/61c952ef339e438d8ce40dd50f32eb5b/FLAGc4574e2c9 [2025-01-08 23:57:25,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e06ec4dad/61c952ef339e438d8ce40dd50f32eb5b [2025-01-08 23:57:25,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:57:25,891 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:57:25,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:57:25,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:57:25,895 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:57:25,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:57:25" (1/1) ... [2025-01-08 23:57:25,898 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ad3d11c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:25, skipping insertion in model container [2025-01-08 23:57:25,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:57:25" (1/1) ... [2025-01-08 23:57:25,928 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:57:26,053 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/eca-rers2012/Problem14_label07.c[4912,4925] [2025-01-08 23:57:26,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:57:26,202 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:57:26,227 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/eca-rers2012/Problem14_label07.c[4912,4925] [2025-01-08 23:57:26,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:57:26,397 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:57:26,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26 WrapperNode [2025-01-08 23:57:26,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:57:26,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:57:26,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:57:26,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:57:26,414 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,441 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,549 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 856 [2025-01-08 23:57:26,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:57:26,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:57:26,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:57:26,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:57:26,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,644 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-01-08 23:57:26,644 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,644 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,722 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,725 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,733 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:57:26,734 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:57:26,734 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:57:26,734 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:57:26,735 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (1/1) ... [2025-01-08 23:57:26,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:57:26,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:26,758 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-08 23:57:26,765 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-08 23:57:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:57:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:57:26,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:57:26,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:57:26,833 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:57:26,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:57:27,710 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2025-01-08 23:57:27,710 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:57:27,721 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:57:27,722 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:57:27,722 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:27 BoogieIcfgContainer [2025-01-08 23:57:27,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:57:27,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:57:27,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:57:27,728 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:57:27,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:57:25" (1/3) ... [2025-01-08 23:57:27,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2154c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:57:27, skipping insertion in model container [2025-01-08 23:57:27,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:57:26" (2/3) ... [2025-01-08 23:57:27,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2154c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:57:27, skipping insertion in model container [2025-01-08 23:57:27,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:27" (3/3) ... [2025-01-08 23:57:27,730 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem14_label07.c [2025-01-08 23:57:27,741 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:57:27,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem14_label07.c that has 1 procedures, 245 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:57:27,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:57:27,803 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;@10f12548, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:57:27,804 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:57:27,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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-01-08 23:57:27,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-08 23:57:27,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:27,815 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:27,815 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:27,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:27,820 INFO L85 PathProgramCache]: Analyzing trace with hash 2062713132, now seen corresponding path program 1 times [2025-01-08 23:57:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525589141] [2025-01-08 23:57:27,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:27,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-08 23:57:27,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-08 23:57:27,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:27,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:28,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:28,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525589141] [2025-01-08 23:57:28,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525589141] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:28,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:28,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:57:28,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521950152] [2025-01-08 23:57:28,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:28,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:28,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:28,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:28,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:28,106 INFO L87 Difference]: Start difference. First operand has 245 states, 243 states have (on average 1.7325102880658436) internal successors, (421), 244 states have internal predecessors, (421), 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) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-01-08 23:57:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:28,996 INFO L93 Difference]: Finished difference Result 669 states and 1197 transitions. [2025-01-08 23:57:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:28,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-01-08 23:57:28,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:29,004 INFO L225 Difference]: With dead ends: 669 [2025-01-08 23:57:29,004 INFO L226 Difference]: Without dead ends: 360 [2025-01-08 23:57:29,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:29,008 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:29,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 77 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:57:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-08 23:57:29,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-01-08 23:57:29,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.6378830083565459) internal successors, (588), 359 states have internal predecessors, (588), 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-01-08 23:57:29,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 588 transitions. [2025-01-08 23:57:29,044 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 588 transitions. Word has length 47 [2025-01-08 23:57:29,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:29,044 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 588 transitions. [2025-01-08 23:57:29,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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-01-08 23:57:29,044 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 588 transitions. [2025-01-08 23:57:29,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-08 23:57:29,046 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:29,047 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:29,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:57:29,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:29,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:29,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1473920420, now seen corresponding path program 1 times [2025-01-08 23:57:29,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:29,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358455047] [2025-01-08 23:57:29,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:29,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:29,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-08 23:57:29,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-08 23:57:29,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:29,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:29,232 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:29,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:29,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358455047] [2025-01-08 23:57:29,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358455047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:29,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:29,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:57:29,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450337513] [2025-01-08 23:57:29,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:29,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:29,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:29,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:29,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:29,234 INFO L87 Difference]: Start difference. First operand 360 states and 588 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-01-08 23:57:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:29,765 INFO L93 Difference]: Finished difference Result 1074 states and 1759 transitions. [2025-01-08 23:57:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 112 [2025-01-08 23:57:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:29,768 INFO L225 Difference]: With dead ends: 1074 [2025-01-08 23:57:29,768 INFO L226 Difference]: Without dead ends: 716 [2025-01-08 23:57:29,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:29,769 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 115 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:29,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 53 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:57:29,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-01-08 23:57:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 538. [2025-01-08 23:57:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 537 states have (on average 1.5605214152700186) internal successors, (838), 537 states have internal predecessors, (838), 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-01-08 23:57:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 838 transitions. [2025-01-08 23:57:29,796 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 838 transitions. Word has length 112 [2025-01-08 23:57:29,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:29,797 INFO L471 AbstractCegarLoop]: Abstraction has 538 states and 838 transitions. [2025-01-08 23:57:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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-01-08 23:57:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 838 transitions. [2025-01-08 23:57:29,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-08 23:57:29,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:29,803 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:29,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:57:29,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:29,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:29,803 INFO L85 PathProgramCache]: Analyzing trace with hash 867079487, now seen corresponding path program 1 times [2025-01-08 23:57:29,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:29,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710831751] [2025-01-08 23:57:29,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:29,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:29,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-08 23:57:29,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-08 23:57:29,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:29,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:30,092 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:57:30,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:30,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710831751] [2025-01-08 23:57:30,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710831751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:30,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870775356] [2025-01-08 23:57:30,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:30,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:30,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:30,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:30,094 INFO L87 Difference]: Start difference. First operand 538 states and 838 transitions. Second operand has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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-01-08 23:57:30,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:30,960 INFO L93 Difference]: Finished difference Result 1608 states and 2466 transitions. [2025-01-08 23:57:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:30,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2025-01-08 23:57:30,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:30,964 INFO L225 Difference]: With dead ends: 1608 [2025-01-08 23:57:30,964 INFO L226 Difference]: Without dead ends: 1072 [2025-01-08 23:57:30,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-01-08 23:57:30,965 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 434 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:30,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 116 Invalid, 1127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:57:30,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2025-01-08 23:57:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1072. [2025-01-08 23:57:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 1071 states have (on average 1.3426704014939308) internal successors, (1438), 1071 states have internal predecessors, (1438), 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-01-08 23:57:31,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1438 transitions. [2025-01-08 23:57:31,004 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1438 transitions. Word has length 126 [2025-01-08 23:57:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 1072 states and 1438 transitions. [2025-01-08 23:57:31,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.5) internal successors, (126), 3 states have internal predecessors, (126), 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-01-08 23:57:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1438 transitions. [2025-01-08 23:57:31,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-08 23:57:31,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:31,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:31,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:57:31,007 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:31,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash -501592401, now seen corresponding path program 1 times [2025-01-08 23:57:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:31,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394073111] [2025-01-08 23:57:31,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:31,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-08 23:57:31,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-08 23:57:31,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:31,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-08 23:57:31,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:31,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394073111] [2025-01-08 23:57:31,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394073111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:31,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:31,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:57:31,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871732252] [2025-01-08 23:57:31,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:31,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:31,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:31,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:31,208 INFO L87 Difference]: Start difference. First operand 1072 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-01-08 23:57:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:31,736 INFO L93 Difference]: Finished difference Result 2320 states and 3226 transitions. [2025-01-08 23:57:31,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:31,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2025-01-08 23:57:31,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:31,742 INFO L225 Difference]: With dead ends: 2320 [2025-01-08 23:57:31,742 INFO L226 Difference]: Without dead ends: 1428 [2025-01-08 23:57:31,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:57:31,746 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:31,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 57 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:57:31,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2025-01-08 23:57:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2025-01-08 23:57:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.2782060266292923) internal successors, (1824), 1427 states have internal predecessors, (1824), 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-01-08 23:57:31,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1824 transitions. [2025-01-08 23:57:31,770 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1824 transitions. Word has length 192 [2025-01-08 23:57:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:31,771 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1824 transitions. [2025-01-08 23:57:31,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 2 states have internal predecessors, (148), 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-01-08 23:57:31,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1824 transitions. [2025-01-08 23:57:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 23:57:31,774 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:31,774 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:57:31,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:57:31,775 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:31,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:31,775 INFO L85 PathProgramCache]: Analyzing trace with hash 829430028, now seen corresponding path program 1 times [2025-01-08 23:57:31,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:31,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728150744] [2025-01-08 23:57:31,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:31,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:31,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 23:57:31,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 23:57:31,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:31,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:31,999 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 23:57:31,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:31,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728150744] [2025-01-08 23:57:31,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728150744] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:31,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:57:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:57:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985521752] [2025-01-08 23:57:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:32,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:57:32,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:57:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:32,001 INFO L87 Difference]: Start difference. First operand 1428 states and 1824 transitions. Second operand has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-01-08 23:57:32,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:32,605 INFO L93 Difference]: Finished difference Result 3061 states and 3980 transitions. [2025-01-08 23:57:32,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:57:32,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-08 23:57:32,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:32,611 INFO L225 Difference]: With dead ends: 3061 [2025-01-08 23:57:32,611 INFO L226 Difference]: Without dead ends: 1784 [2025-01-08 23:57:32,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:57:32,613 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 110 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:32,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 113 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:57:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2025-01-08 23:57:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1428. [2025-01-08 23:57:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 1427 states have (on average 1.1590749824807287) internal successors, (1654), 1427 states have internal predecessors, (1654), 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-01-08 23:57:32,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1654 transitions. [2025-01-08 23:57:32,634 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1654 transitions. Word has length 206 [2025-01-08 23:57:32,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:32,634 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1654 transitions. [2025-01-08 23:57:32,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.75) internal successors, (191), 3 states have internal predecessors, (191), 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-01-08 23:57:32,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1654 transitions. [2025-01-08 23:57:32,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2025-01-08 23:57:32,637 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:32,637 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:57:32,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:57:32,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:32,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:32,637 INFO L85 PathProgramCache]: Analyzing trace with hash 368934559, now seen corresponding path program 1 times [2025-01-08 23:57:32,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:32,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747308228] [2025-01-08 23:57:32,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:32,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:32,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-08 23:57:32,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-08 23:57:32,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:32,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 241 proven. 100 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-08 23:57:33,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:33,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747308228] [2025-01-08 23:57:33,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747308228] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:33,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333396275] [2025-01-08 23:57:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:33,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:33,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:33,034 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-08 23:57:33,036 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-08 23:57:33,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes. [2025-01-08 23:57:33,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements. [2025-01-08 23:57:33,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:33,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:33,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:33,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2025-01-08 23:57:33,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:33,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333396275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:33,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:33,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:57:33,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787716631] [2025-01-08 23:57:33,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:33,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:33,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:33,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:33,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:33,229 INFO L87 Difference]: Start difference. First operand 1428 states and 1654 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-08 23:57:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:33,659 INFO L93 Difference]: Finished difference Result 3388 states and 3992 transitions. [2025-01-08 23:57:33,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:33,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2025-01-08 23:57:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:33,665 INFO L225 Difference]: With dead ends: 3388 [2025-01-08 23:57:33,665 INFO L226 Difference]: Without dead ends: 2140 [2025-01-08 23:57:33,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:57:33,667 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 134 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:33,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 257 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:33,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2025-01-08 23:57:33,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1962. [2025-01-08 23:57:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1448240693523712) internal successors, (2245), 1961 states have internal predecessors, (2245), 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-01-08 23:57:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2245 transitions. [2025-01-08 23:57:33,719 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2245 transitions. Word has length 337 [2025-01-08 23:57:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2245 transitions. [2025-01-08 23:57:33,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-01-08 23:57:33,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2245 transitions. [2025-01-08 23:57:33,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-01-08 23:57:33,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:33,725 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:33,734 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-08 23:57:33,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:33,926 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:33,926 INFO L85 PathProgramCache]: Analyzing trace with hash -997610322, now seen corresponding path program 1 times [2025-01-08 23:57:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922507014] [2025-01-08 23:57:33,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:33,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-08 23:57:33,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-08 23:57:33,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:33,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 440 proven. 130 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-08 23:57:34,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:34,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922507014] [2025-01-08 23:57:34,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922507014] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:34,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480716595] [2025-01-08 23:57:34,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:34,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:34,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:34,477 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-08 23:57:34,482 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-08 23:57:34,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-01-08 23:57:34,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-01-08 23:57:34,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:34,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:34,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 578 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:34,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:34,709 INFO L134 CoverageAnalysis]: Checked inductivity of 720 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 541 trivial. 0 not checked. [2025-01-08 23:57:34,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:34,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480716595] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:34,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:34,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:57:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517772230] [2025-01-08 23:57:34,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:34,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:34,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:34,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:34,711 INFO L87 Difference]: Start difference. First operand 1962 states and 2245 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-01-08 23:57:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:35,430 INFO L93 Difference]: Finished difference Result 2498 states and 2862 transitions. [2025-01-08 23:57:35,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:35,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 442 [2025-01-08 23:57:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:35,436 INFO L225 Difference]: With dead ends: 2498 [2025-01-08 23:57:35,436 INFO L226 Difference]: Without dead ends: 2496 [2025-01-08 23:57:35,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:35,437 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 155 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:35,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 11 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:57:35,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-01-08 23:57:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 1962. [2025-01-08 23:57:35,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1961 states have (on average 1.1448240693523712) internal successors, (2245), 1961 states have internal predecessors, (2245), 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-01-08 23:57:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2245 transitions. [2025-01-08 23:57:35,481 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2245 transitions. Word has length 442 [2025-01-08 23:57:35,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:35,482 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2245 transitions. [2025-01-08 23:57:35,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-01-08 23:57:35,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2245 transitions. [2025-01-08 23:57:35,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2025-01-08 23:57:35,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:57:35,486 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:35,493 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-01-08 23:57:35,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:35,692 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:57:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:57:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1172094798, now seen corresponding path program 1 times [2025-01-08 23:57:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:57:35,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396237769] [2025-01-08 23:57:35,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:35,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:57:35,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-08 23:57:35,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-08 23:57:35,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:35,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:36,537 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 497 proven. 130 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-08 23:57:36,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:57:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396237769] [2025-01-08 23:57:36,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396237769] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:57:36,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789407609] [2025-01-08 23:57:36,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:57:36,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:36,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:57:36,539 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-08 23:57:36,541 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-08 23:57:36,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes. [2025-01-08 23:57:36,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements. [2025-01-08 23:57:36,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:57:36,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:57:36,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:57:36,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:57:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 777 backedges. 179 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2025-01-08 23:57:36,708 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:57:36,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789407609] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:57:36,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:57:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:57:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172676582] [2025-01-08 23:57:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:57:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:57:36,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:57:36,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:57:36,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:36,710 INFO L87 Difference]: Start difference. First operand 1962 states and 2245 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-01-08 23:57:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:57:37,164 INFO L93 Difference]: Finished difference Result 4632 states and 5388 transitions. [2025-01-08 23:57:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:57:37,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 461 [2025-01-08 23:57:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:57:37,165 INFO L225 Difference]: With dead ends: 4632 [2025-01-08 23:57:37,165 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:57:37,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 460 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:57:37,169 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 144 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:57:37,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 232 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:57:37,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:57:37,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:57:37,170 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-01-08 23:57:37,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:57:37,170 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 461 [2025-01-08 23:57:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:57:37,171 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:57:37,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 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-01-08 23:57:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:57:37,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:57:37,173 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:57:37,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:57:37,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:57:37,381 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:57:37,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:57:37,458 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:57:37,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:57:37 BoogieIcfgContainer [2025-01-08 23:57:37,475 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:57:37,476 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:57:37,476 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:57:37,476 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:57:37,477 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:57:27" (3/4) ... [2025-01-08 23:57:37,479 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:57:37,500 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:57:37,501 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:57:37,502 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:57:37,502 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:57:37,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:57:37,656 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:57:37,656 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:57:37,657 INFO L158 Benchmark]: Toolchain (without parser) took 11765.41ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 123.7MB in the beginning and 361.3MB in the end (delta: -237.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,657 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:57:37,657 INFO L158 Benchmark]: CACSL2BoogieTranslator took 511.87ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 91.6MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.59ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 82.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,657 INFO L158 Benchmark]: Boogie Preprocessor took 178.76ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 70.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,658 INFO L158 Benchmark]: RCFGBuilder took 988.23ms. Allocated memory is still 167.8MB. Free memory was 69.9MB in the beginning and 115.8MB in the end (delta: -45.9MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,658 INFO L158 Benchmark]: TraceAbstraction took 9751.14ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 114.8MB in the beginning and 378.1MB in the end (delta: -263.2MB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,658 INFO L158 Benchmark]: Witness Printer took 180.43ms. Allocated memory is still 427.8MB. Free memory was 378.1MB in the beginning and 361.3MB in the end (delta: 16.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 23:57:37,663 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 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 511.87ms. Allocated memory is still 167.8MB. Free memory was 123.0MB in the beginning and 91.6MB in the end (delta: 31.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.59ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 82.6MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.76ms. Allocated memory is still 167.8MB. Free memory was 82.6MB in the beginning and 70.6MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 988.23ms. Allocated memory is still 167.8MB. Free memory was 69.9MB in the beginning and 115.8MB in the end (delta: -45.9MB). Peak memory consumption was 52.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9751.14ms. Allocated memory was 167.8MB in the beginning and 427.8MB in the end (delta: 260.0MB). Free memory was 114.8MB in the beginning and 378.1MB in the end (delta: -263.2MB). Peak memory consumption was 240.8MB. Max. memory is 16.1GB. * Witness Printer took 180.43ms. Allocated memory is still 427.8MB. Free memory was 378.1MB in the beginning and 361.3MB in the end (delta: 16.7MB). 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: 155]: 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 1 procedures, 245 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.6s, OverallIterations: 8, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1376 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1376 mSDsluCounter, 916 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 907 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4517 IncrementalHoareTripleChecker+Invalid, 5424 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 907 mSolverCounterUnsat, 870 mSDtfsCounter, 4517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1264 GetRequests, 1242 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1962occurred in iteration=6, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 1246 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3163 NumberOfCodeBlocks, 3163 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 3152 ConstructedInterpolants, 0 QuantifiedInterpolants, 13247 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1626 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3833/4193 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: 890]: Loop Invariant Derived loop invariant: (((((5 < a15) || (9 < a21)) || ((a24 == 1) && (((long long) 49 + a12) <= 0))) || (a21 < 8)) || (11 < a12)) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:57:37,686 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 Result: TRUE