./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label11.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 073d5e73e021c2fbb0b260c14ff6c85c25beacc7878838f02ad68dea4d2f83b6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:43:55,011 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:43:55,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:43:55,091 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:43:55,091 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:43:55,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:43:55,116 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:43:55,116 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:43:55,117 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:43:55,117 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:43:55,117 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:43:55,117 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:43:55,117 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:43:55,117 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:43:55,117 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:43:55,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:43:55,118 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:43:55,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:43:55,118 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:43:55,119 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:43:55,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:43:55,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:43:55,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:43:55,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:43:55,119 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:43:55,119 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 -> 073d5e73e021c2fbb0b260c14ff6c85c25beacc7878838f02ad68dea4d2f83b6 [2025-02-05 10:43:55,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:43:55,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:43:55,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:43:55,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:43:55,368 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:43:55,369 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label11.c [2025-02-05 10:43:56,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1f390539/98f6ada3f1b14fec8438106a95ca1959/FLAGf16525b45 [2025-02-05 10:43:56,984 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:43:56,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label11.c [2025-02-05 10:43:56,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1f390539/98f6ada3f1b14fec8438106a95ca1959/FLAGf16525b45 [2025-02-05 10:43:57,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d1f390539/98f6ada3f1b14fec8438106a95ca1959 [2025-02-05 10:43:57,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:43:57,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:43:57,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:43:57,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:43:57,017 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:43:57,017 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,017 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723fbd35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57, skipping insertion in model container [2025-02-05 10:43:57,018 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:43:57,272 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/Problem02_label11.c[17696,17709] [2025-02-05 10:43:57,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:43:57,313 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:43:57,378 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/Problem02_label11.c[17696,17709] [2025-02-05 10:43:57,391 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:43:57,403 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:43:57,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57 WrapperNode [2025-02-05 10:43:57,404 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:43:57,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:43:57,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:43:57,405 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:43:57,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,465 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-02-05 10:43:57,466 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:43:57,466 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:43:57,467 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:43:57,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:43:57,473 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,474 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,507 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 10:43:57,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,529 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:43:57,538 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:43:57,538 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:43:57,538 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:43:57,539 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (1/1) ... [2025-02-05 10:43:57,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:43:57,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:43:57,573 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 10:43:57,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 10:43:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:43:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:43:57,604 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:43:57,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:43:57,660 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:43:57,662 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:43:58,646 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 10:43:58,647 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:43:58,660 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:43:58,661 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:43:58,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:58 BoogieIcfgContainer [2025-02-05 10:43:58,661 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:43:58,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:43:58,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:43:58,667 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:43:58,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:43:57" (1/3) ... [2025-02-05 10:43:58,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382be138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:58, skipping insertion in model container [2025-02-05 10:43:58,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:43:57" (2/3) ... [2025-02-05 10:43:58,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@382be138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:43:58, skipping insertion in model container [2025-02-05 10:43:58,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:58" (3/3) ... [2025-02-05 10:43:58,670 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label11.c [2025-02-05 10:43:58,682 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:43:58,684 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label11.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:43:58,731 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:43:58,740 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;@263f4e04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:43:58,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:43:58,745 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 10:43:58,753 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:58,754 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:58,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:58,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:58,759 INFO L85 PathProgramCache]: Analyzing trace with hash 402754018, now seen corresponding path program 1 times [2025-02-05 10:43:58,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:58,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993125171] [2025-02-05 10:43:58,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:58,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:58,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 10:43:58,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 10:43:58,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:58,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:43:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:43:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:43:59,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993125171] [2025-02-05 10:43:59,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993125171] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:43:59,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:43:59,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:43:59,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132352284] [2025-02-05 10:43:59,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:43:59,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:43:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:43:59,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:43:59,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:43:59,234 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:59,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:43:59,853 INFO L93 Difference]: Finished difference Result 630 states and 1067 transitions. [2025-02-05 10:43:59,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:43:59,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2025-02-05 10:43:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:43:59,863 INFO L225 Difference]: With dead ends: 630 [2025-02-05 10:43:59,863 INFO L226 Difference]: Without dead ends: 318 [2025-02-05 10:43:59,867 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-02-05 10:43:59,870 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 122 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 10:43:59,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 10:43:59,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-05 10:43:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2025-02-05 10:43:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2025-02-05 10:43:59,916 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 108 [2025-02-05 10:43:59,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:43:59,916 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2025-02-05 10:43:59,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:43:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2025-02-05 10:43:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 10:43:59,920 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:43:59,920 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:43:59,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:43:59,921 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:43:59,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:43:59,921 INFO L85 PathProgramCache]: Analyzing trace with hash -865824443, now seen corresponding path program 1 times [2025-02-05 10:43:59,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:43:59,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870497122] [2025-02-05 10:43:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:43:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:43:59,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 10:43:59,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 10:43:59,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:43:59,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870497122] [2025-02-05 10:44:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870497122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:00,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304911956] [2025-02-05 10:44:00,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:00,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 10:44:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:00,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 10:44:00,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 10:44:00,287 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 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-02-05 10:44:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:01,060 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2025-02-05 10:44:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 10:44:01,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 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-02-05 10:44:01,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:01,064 INFO L225 Difference]: With dead ends: 999 [2025-02-05 10:44:01,064 INFO L226 Difference]: Without dead ends: 600 [2025-02-05 10:44:01,065 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-02-05 10:44:01,068 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 170 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:01,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 114 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:44:01,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-02-05 10:44:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-02-05 10:44:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.357262103505843) internal successors, (813), 599 states have internal predecessors, (813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 813 transitions. [2025-02-05 10:44:01,091 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 813 transitions. Word has length 112 [2025-02-05 10:44:01,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:01,091 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 813 transitions. [2025-02-05 10:44:01,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 3 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-02-05 10:44:01,091 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 813 transitions. [2025-02-05 10:44:01,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-02-05 10:44:01,094 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:01,094 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:01,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:44:01,094 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:01,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1965153891, now seen corresponding path program 1 times [2025-02-05 10:44:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:01,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304462016] [2025-02-05 10:44:01,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:01,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-05 10:44:01,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-05 10:44:01,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:01,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:01,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304462016] [2025-02-05 10:44:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304462016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:01,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:01,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:01,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508756106] [2025-02-05 10:44:01,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:01,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:01,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:01,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:01,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:01,251 INFO L87 Difference]: Start difference. First operand 600 states and 813 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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-02-05 10:44:01,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:01,676 INFO L93 Difference]: Finished difference Result 1779 states and 2417 transitions. [2025-02-05 10:44:01,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:01,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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-02-05 10:44:01,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:01,680 INFO L225 Difference]: With dead ends: 1779 [2025-02-05 10:44:01,680 INFO L226 Difference]: Without dead ends: 1181 [2025-02-05 10:44:01,681 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-02-05 10:44:01,682 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:01,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 100 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:01,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2025-02-05 10:44:01,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1173. [2025-02-05 10:44:01,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.310580204778157) internal successors, (1536), 1172 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1536 transitions. [2025-02-05 10:44:01,708 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1536 transitions. Word has length 126 [2025-02-05 10:44:01,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:01,708 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1536 transitions. [2025-02-05 10:44:01,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 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-02-05 10:44:01,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1536 transitions. [2025-02-05 10:44:01,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-02-05 10:44:01,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:01,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:01,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:44:01,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:01,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:01,713 INFO L85 PathProgramCache]: Analyzing trace with hash -168589844, now seen corresponding path program 1 times [2025-02-05 10:44:01,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:01,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277268994] [2025-02-05 10:44:01,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:01,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:01,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-05 10:44:01,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-05 10:44:01,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:01,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:01,850 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-05 10:44:01,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:01,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277268994] [2025-02-05 10:44:01,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277268994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:01,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:01,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:01,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960714647] [2025-02-05 10:44:01,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:01,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:01,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:01,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:01,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:01,855 INFO L87 Difference]: Start difference. First operand 1173 states and 1536 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:02,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:02,279 INFO L93 Difference]: Finished difference Result 3329 states and 4384 transitions. [2025-02-05 10:44:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 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 138 [2025-02-05 10:44:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:02,287 INFO L225 Difference]: With dead ends: 3329 [2025-02-05 10:44:02,287 INFO L226 Difference]: Without dead ends: 2158 [2025-02-05 10:44:02,288 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-02-05 10:44:02,289 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 124 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:02,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 129 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:02,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2025-02-05 10:44:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2025-02-05 10:44:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.1991643454038998) internal successors, (2583), 2154 states have internal predecessors, (2583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:02,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2583 transitions. [2025-02-05 10:44:02,329 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2583 transitions. Word has length 138 [2025-02-05 10:44:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:02,329 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2583 transitions. [2025-02-05 10:44:02,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 2 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2583 transitions. [2025-02-05 10:44:02,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-02-05 10:44:02,333 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:02,333 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:02,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:44:02,334 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:02,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:02,334 INFO L85 PathProgramCache]: Analyzing trace with hash 680163127, now seen corresponding path program 1 times [2025-02-05 10:44:02,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:02,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52559629] [2025-02-05 10:44:02,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:02,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:02,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-05 10:44:02,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-05 10:44:02,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:02,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:02,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52559629] [2025-02-05 10:44:02,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52559629] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:02,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:02,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529374739] [2025-02-05 10:44:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:02,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:02,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:02,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:02,477 INFO L87 Difference]: Start difference. First operand 2155 states and 2583 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:02,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:02,909 INFO L93 Difference]: Finished difference Result 5432 states and 6637 transitions. [2025-02-05 10:44:02,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:02,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 161 [2025-02-05 10:44:02,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:02,920 INFO L225 Difference]: With dead ends: 5432 [2025-02-05 10:44:02,921 INFO L226 Difference]: Without dead ends: 3279 [2025-02-05 10:44:02,923 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:02,924 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 136 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:02,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 247 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3279 states. [2025-02-05 10:44:02,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3279 to 3279. [2025-02-05 10:44:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 3278 states have (on average 1.1705308114704087) internal successors, (3837), 3278 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 3837 transitions. [2025-02-05 10:44:02,979 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 3837 transitions. Word has length 161 [2025-02-05 10:44:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 3279 states and 3837 transitions. [2025-02-05 10:44:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 3837 transitions. [2025-02-05 10:44:03,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-02-05 10:44:03,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:03,012 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:03,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:44:03,013 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:03,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1128772468, now seen corresponding path program 1 times [2025-02-05 10:44:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152461354] [2025-02-05 10:44:03,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:03,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-02-05 10:44:03,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-02-05 10:44:03,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:03,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:03,122 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 10:44:03,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:03,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152461354] [2025-02-05 10:44:03,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152461354] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:03,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:03,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:03,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298028353] [2025-02-05 10:44:03,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:03,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:03,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:03,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:03,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:03,125 INFO L87 Difference]: Start difference. First operand 3279 states and 3837 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:03,535 INFO L93 Difference]: Finished difference Result 7542 states and 8777 transitions. [2025-02-05 10:44:03,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:03,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 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 180 [2025-02-05 10:44:03,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:03,547 INFO L225 Difference]: With dead ends: 7542 [2025-02-05 10:44:03,547 INFO L226 Difference]: Without dead ends: 3705 [2025-02-05 10:44:03,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:03,552 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:03,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 60 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:03,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3705 states. [2025-02-05 10:44:03,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3705 to 3699. [2025-02-05 10:44:03,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3699 states, 3698 states have (on average 1.099242833964305) internal successors, (4065), 3698 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3699 states to 3699 states and 4065 transitions. [2025-02-05 10:44:03,616 INFO L78 Accepts]: Start accepts. Automaton has 3699 states and 4065 transitions. Word has length 180 [2025-02-05 10:44:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:03,616 INFO L471 AbstractCegarLoop]: Abstraction has 3699 states and 4065 transitions. [2025-02-05 10:44:03,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:03,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3699 states and 4065 transitions. [2025-02-05 10:44:03,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-02-05 10:44:03,623 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:03,623 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:03,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:44:03,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:03,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:03,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1132828182, now seen corresponding path program 1 times [2025-02-05 10:44:03,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:03,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816619830] [2025-02-05 10:44:03,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:03,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:03,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-02-05 10:44:03,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-02-05 10:44:03,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:03,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-02-05 10:44:03,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:03,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816619830] [2025-02-05 10:44:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816619830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:03,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:03,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 10:44:03,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829473637] [2025-02-05 10:44:03,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:03,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 10:44:03,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:03,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 10:44:03,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:44:03,943 INFO L87 Difference]: Start difference. First operand 3699 states and 4065 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:04,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:04,754 INFO L93 Difference]: Finished difference Result 7676 states and 8422 transitions. [2025-02-05 10:44:04,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 10:44:04,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 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 184 [2025-02-05 10:44:04,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:04,765 INFO L225 Difference]: With dead ends: 7676 [2025-02-05 10:44:04,765 INFO L226 Difference]: Without dead ends: 3979 [2025-02-05 10:44:04,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:04,770 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 326 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:04,770 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 152 Invalid, 996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 10:44:04,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3979 states. [2025-02-05 10:44:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3979 to 3839. [2025-02-05 10:44:04,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3839 states, 3838 states have (on average 1.0964043772798333) internal successors, (4208), 3838 states have internal predecessors, (4208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3839 states to 3839 states and 4208 transitions. [2025-02-05 10:44:04,832 INFO L78 Accepts]: Start accepts. Automaton has 3839 states and 4208 transitions. Word has length 184 [2025-02-05 10:44:04,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:04,832 INFO L471 AbstractCegarLoop]: Abstraction has 3839 states and 4208 transitions. [2025-02-05 10:44:04,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3839 states and 4208 transitions. [2025-02-05 10:44:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-02-05 10:44:04,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:04,840 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, 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, 1, 1, 1, 1] [2025-02-05 10:44:04,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 10:44:04,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:04,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:04,842 INFO L85 PathProgramCache]: Analyzing trace with hash 1202340747, now seen corresponding path program 1 times [2025-02-05 10:44:04,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151637179] [2025-02-05 10:44:04,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:04,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 10:44:04,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 10:44:04,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:04,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:05,201 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 68 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:05,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151637179] [2025-02-05 10:44:05,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151637179] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:05,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768620202] [2025-02-05 10:44:05,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:05,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:05,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:05,203 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:44:05,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:44:05,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-02-05 10:44:05,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-02-05 10:44:05,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:05,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:05,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:44:05,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:05,430 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 10:44:05,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:05,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768620202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:05,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:05,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:44:05,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948581026] [2025-02-05 10:44:05,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:05,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:05,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:05,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:05,431 INFO L87 Difference]: Start difference. First operand 3839 states and 4208 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:05,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:05,760 INFO L93 Difference]: Finished difference Result 8518 states and 9438 transitions. [2025-02-05 10:44:05,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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-02-05 10:44:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:05,773 INFO L225 Difference]: With dead ends: 8518 [2025-02-05 10:44:05,774 INFO L226 Difference]: Without dead ends: 4681 [2025-02-05 10:44:05,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:05,778 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 58 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:05,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 225 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2025-02-05 10:44:05,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4259. [2025-02-05 10:44:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4259 states, 4258 states have (on average 1.1049788633161108) internal successors, (4705), 4258 states have internal predecessors, (4705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4259 states to 4259 states and 4705 transitions. [2025-02-05 10:44:05,823 INFO L78 Accepts]: Start accepts. Automaton has 4259 states and 4705 transitions. Word has length 206 [2025-02-05 10:44:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:05,823 INFO L471 AbstractCegarLoop]: Abstraction has 4259 states and 4705 transitions. [2025-02-05 10:44:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 4259 states and 4705 transitions. [2025-02-05 10:44:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-02-05 10:44:05,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:05,829 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:05,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 10:44:06,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:06,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:06,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:06,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1518999720, now seen corresponding path program 1 times [2025-02-05 10:44:06,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:06,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033255940] [2025-02-05 10:44:06,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:06,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:06,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-02-05 10:44:06,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-02-05 10:44:06,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:06,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:06,149 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 10:44:06,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:06,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033255940] [2025-02-05 10:44:06,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033255940] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:06,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:06,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:06,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739098000] [2025-02-05 10:44:06,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:06,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:06,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:06,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:06,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:06,152 INFO L87 Difference]: Start difference. First operand 4259 states and 4705 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:06,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:06,439 INFO L93 Difference]: Finished difference Result 8514 states and 9406 transitions. [2025-02-05 10:44:06,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:06,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 222 [2025-02-05 10:44:06,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:06,447 INFO L225 Difference]: With dead ends: 8514 [2025-02-05 10:44:06,447 INFO L226 Difference]: Without dead ends: 4257 [2025-02-05 10:44:06,451 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:06,451 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 159 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:06,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 67 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:06,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4257 states. [2025-02-05 10:44:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4257 to 4115. [2025-02-05 10:44:06,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4115 states, 4114 states have (on average 1.0913952357802625) internal successors, (4490), 4114 states have internal predecessors, (4490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:06,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 4490 transitions. [2025-02-05 10:44:06,492 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 4490 transitions. Word has length 222 [2025-02-05 10:44:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:06,492 INFO L471 AbstractCegarLoop]: Abstraction has 4115 states and 4490 transitions. [2025-02-05 10:44:06,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 4490 transitions. [2025-02-05 10:44:06,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-02-05 10:44:06,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:06,497 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:06,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:44:06,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:06,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:06,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1516521507, now seen corresponding path program 1 times [2025-02-05 10:44:06,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:06,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337053798] [2025-02-05 10:44:06,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:06,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:06,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-02-05 10:44:06,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-02-05 10:44:06,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:06,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:06,595 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2025-02-05 10:44:06,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:06,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337053798] [2025-02-05 10:44:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337053798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355656793] [2025-02-05 10:44:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:06,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:06,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:06,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:06,596 INFO L87 Difference]: Start difference. First operand 4115 states and 4490 transitions. Second operand has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:06,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:06,915 INFO L93 Difference]: Finished difference Result 9059 states and 9983 transitions. [2025-02-05 10:44:06,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:06,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 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 281 [2025-02-05 10:44:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:06,922 INFO L225 Difference]: With dead ends: 9059 [2025-02-05 10:44:06,922 INFO L226 Difference]: Without dead ends: 3255 [2025-02-05 10:44:06,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:06,960 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 100 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:06,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 253 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:06,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2025-02-05 10:44:06,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3255. [2025-02-05 10:44:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 3254 states have (on average 1.0777504609711124) internal successors, (3507), 3254 states have internal predecessors, (3507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 3507 transitions. [2025-02-05 10:44:06,990 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 3507 transitions. Word has length 281 [2025-02-05 10:44:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:06,990 INFO L471 AbstractCegarLoop]: Abstraction has 3255 states and 3507 transitions. [2025-02-05 10:44:06,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.333333333333336) internal successors, (178), 3 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 3507 transitions. [2025-02-05 10:44:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2025-02-05 10:44:06,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:06,995 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:06,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:44:06,995 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:06,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:06,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1690156027, now seen corresponding path program 1 times [2025-02-05 10:44:06,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:06,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164510532] [2025-02-05 10:44:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:06,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:07,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 10:44:07,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 10:44:07,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:07,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 352 proven. 16 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2025-02-05 10:44:07,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164510532] [2025-02-05 10:44:07,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164510532] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:07,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479904422] [2025-02-05 10:44:07,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:07,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:07,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:07,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:44:07,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 10:44:07,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 315 statements into 1 equivalence classes. [2025-02-05 10:44:07,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 315 of 315 statements. [2025-02-05 10:44:07,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:07,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:07,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 540 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:44:07,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 517 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2025-02-05 10:44:07,584 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479904422] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:07,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:07,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-02-05 10:44:07,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175519085] [2025-02-05 10:44:07,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:07,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:07,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:07,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:07,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:44:07,586 INFO L87 Difference]: Start difference. First operand 3255 states and 3507 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:07,740 INFO L93 Difference]: Finished difference Result 6076 states and 6568 transitions. [2025-02-05 10:44:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 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 315 [2025-02-05 10:44:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:07,750 INFO L225 Difference]: With dead ends: 6076 [2025-02-05 10:44:07,753 INFO L226 Difference]: Without dead ends: 2823 [2025-02-05 10:44:07,756 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 10:44:07,757 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 114 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:07,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 18 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 10:44:07,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2025-02-05 10:44:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2403. [2025-02-05 10:44:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 2402 states have (on average 1.0749375520399667) internal successors, (2582), 2402 states have internal predecessors, (2582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 2582 transitions. [2025-02-05 10:44:07,795 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 2582 transitions. Word has length 315 [2025-02-05 10:44:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:07,796 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 2582 transitions. [2025-02-05 10:44:07,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 2 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2582 transitions. [2025-02-05 10:44:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2025-02-05 10:44:07,800 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:07,800 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:07,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 10:44:08,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:08,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:08,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:08,006 INFO L85 PathProgramCache]: Analyzing trace with hash 674026926, now seen corresponding path program 1 times [2025-02-05 10:44:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:08,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120193857] [2025-02-05 10:44:08,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:08,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:08,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 320 statements into 1 equivalence classes. [2025-02-05 10:44:08,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 320 of 320 statements. [2025-02-05 10:44:08,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:08,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:08,106 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 385 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-02-05 10:44:08,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:08,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120193857] [2025-02-05 10:44:08,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120193857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:08,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:08,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:08,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599629006] [2025-02-05 10:44:08,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:08,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:08,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:08,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:08,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:08,109 INFO L87 Difference]: Start difference. First operand 2403 states and 2582 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:08,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:08,367 INFO L93 Difference]: Finished difference Result 5223 states and 5603 transitions. [2025-02-05 10:44:08,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:08,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 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 320 [2025-02-05 10:44:08,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:08,369 INFO L225 Difference]: With dead ends: 5223 [2025-02-05 10:44:08,369 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:44:08,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:08,373 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 149 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:08,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 40 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 10:44:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:44:08,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:44:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:44:08,374 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 320 [2025-02-05 10:44:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:08,374 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:44:08,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:44:08,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:44:08,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:44:08,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 10:44:08,378 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:08,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:44:08,638 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:44:08,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:44:08 BoogieIcfgContainer [2025-02-05 10:44:08,650 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:44:08,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:44:08,651 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:44:08,651 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:44:08,651 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:43:58" (3/4) ... [2025-02-05 10:44:08,654 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:44:08,671 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:44:08,671 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:44:08,672 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:44:08,672 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:44:08,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:44:08,756 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:44:08,756 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:44:08,757 INFO L158 Benchmark]: Toolchain (without parser) took 11744.43ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 104.6MB in the beginning and 459.9MB in the end (delta: -355.4MB). Peak memory consumption was 32.0MB. Max. memory is 16.1GB. [2025-02-05 10:44:08,757 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:08,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 391.18ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 79.4MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:44:08,757 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.18ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 74.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:08,758 INFO L158 Benchmark]: Boogie Preprocessor took 70.97ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 70.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:08,758 INFO L158 Benchmark]: IcfgBuilder took 1123.20ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 58.3MB in the end (delta: 11.8MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. [2025-02-05 10:44:08,758 INFO L158 Benchmark]: TraceAbstraction took 9987.13ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 57.5MB in the beginning and 472.7MB in the end (delta: -415.2MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. [2025-02-05 10:44:08,758 INFO L158 Benchmark]: Witness Printer took 105.84ms. Allocated memory is still 528.5MB. Free memory was 472.7MB in the beginning and 459.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:08,759 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.23ms. Allocated memory is still 201.3MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 391.18ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 79.4MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.18ms. Allocated memory is still 142.6MB. Free memory was 79.4MB in the beginning and 74.0MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 70.97ms. Allocated memory is still 142.6MB. Free memory was 74.0MB in the beginning and 70.1MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1123.20ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 58.3MB in the end (delta: 11.8MB). Peak memory consumption was 50.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9987.13ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 57.5MB in the beginning and 472.7MB in the end (delta: -415.2MB). Peak memory consumption was 198.5MB. Max. memory is 16.1GB. * Witness Printer took 105.84ms. Allocated memory is still 528.5MB. Free memory was 472.7MB in the beginning and 459.9MB in the end (delta: 12.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: 506]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.7s, OverallIterations: 12, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1771 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1771 mSDsluCounter, 1524 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 749 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5037 IncrementalHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 749 mSolverCounterUnsat, 1267 mSDtfsCounter, 5037 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 556 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4259occurred in iteration=8, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1141 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2874 NumberOfCodeBlocks, 2874 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2860 ConstructedInterpolants, 0 QuantifiedInterpolants, 8107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 870 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 2836/2910 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: 616]: Location Invariant Derived location invariant: (((((((((a28 == 10) && (a17 <= 8)) || ((a17 <= 8) && (a28 == 9))) || (((a28 <= 9) && (a17 <= 8)) && (a19 == 1))) || ((((((a25 == 1) && (a28 == 11)) && (a21 == 1)) && (a17 <= 8)) && (a19 == 1)) && (a11 != 1))) || ((a17 <= 8) && (a28 <= 7))) || (((a28 <= 9) && (a17 <= 8)) && (a25 == 0))) || ((10 <= a28) && (a17 <= 7))) || ((a17 <= 7) && (a11 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:44:08,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE