./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label03.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/Problem11_label03.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 17c92e2f7b920672487a7c33b9216e5136ad737688964579812bc0c782959b18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:30:56,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:30:56,287 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:30:56,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:30:56,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:30:56,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:30:56,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:30:56,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:30:56,319 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:30:56,320 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:30:56,320 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:30:56,320 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:30:56,321 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:30:56,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:30:56,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:30:56,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:30:56,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:30:56,323 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:30:56,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:30:56,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:56,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:30:56,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:30:56,324 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 -> 17c92e2f7b920672487a7c33b9216e5136ad737688964579812bc0c782959b18 [2025-02-05 11:30:56,543 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:30:56,550 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:30:56,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:30:56,552 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:30:56,552 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:30:56,553 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label03.c [2025-02-05 11:30:57,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0fa35ce6/a21d1933d51c46269fe0eb090677f3e5/FLAG219dc8430 [2025-02-05 11:30:58,002 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:30:58,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label03.c [2025-02-05 11:30:58,030 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0fa35ce6/a21d1933d51c46269fe0eb090677f3e5/FLAG219dc8430 [2025-02-05 11:30:58,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0fa35ce6/a21d1933d51c46269fe0eb090677f3e5 [2025-02-05 11:30:58,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:30:58,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:30:58,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:58,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:30:58,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:30:58,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:58,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbd03ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58, skipping insertion in model container [2025-02-05 11:30:58,225 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:58,293 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:30:58,562 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/Problem11_label03.c[4398,4411] [2025-02-05 11:30:58,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:58,716 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:30:58,736 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/Problem11_label03.c[4398,4411] [2025-02-05 11:30:58,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:30:58,857 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:30:58,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58 WrapperNode [2025-02-05 11:30:58,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:30:58,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:58,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:30:58,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:30:58,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:58,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:58,976 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-02-05 11:30:58,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:30:58,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:30:58,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:30:58,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:30:58,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:58,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:58,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,073 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 11:30:59,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,108 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,134 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:30:59,136 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:30:59,136 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:30:59,136 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:30:59,137 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (1/1) ... [2025-02-05 11:30:59,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:30:59,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:30:59,161 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 11:30:59,163 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 11:30:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:30:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:30:59,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:30:59,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:30:59,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:30:59,235 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:31:00,550 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-02-05 11:31:00,550 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:31:00,568 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:31:00,570 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:31:00,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:31:00 BoogieIcfgContainer [2025-02-05 11:31:00,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:31:00,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:31:00,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:31:00,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:31:00,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:30:58" (1/3) ... [2025-02-05 11:31:00,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa02a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:31:00, skipping insertion in model container [2025-02-05 11:31:00,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:30:58" (2/3) ... [2025-02-05 11:31:00,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa02a28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:31:00, skipping insertion in model container [2025-02-05 11:31:00,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:31:00" (3/3) ... [2025-02-05 11:31:00,577 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label03.c [2025-02-05 11:31:00,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:31:00,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label03.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:31:00,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:31:00,671 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;@552a1cd4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:31:00,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:31:00,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 11:31:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-05 11:31:00,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:00,678 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] [2025-02-05 11:31:00,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:00,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:00,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1654557210, now seen corresponding path program 1 times [2025-02-05 11:31:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:00,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86286744] [2025-02-05 11:31:00,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:00,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-05 11:31:00,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-05 11:31:00,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:00,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:00,928 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 11:31:00,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:00,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86286744] [2025-02-05 11:31:00,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86286744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:00,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:00,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:31:00,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625871815] [2025-02-05 11:31:00,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:00,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:00,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:00,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:00,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:00,954 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 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 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 11:31:01,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:01,942 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-02-05 11:31:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 30 [2025-02-05 11:31:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:01,957 INFO L225 Difference]: With dead ends: 769 [2025-02-05 11:31:01,957 INFO L226 Difference]: Without dead ends: 422 [2025-02-05 11:31:01,960 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 11:31:01,965 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 210 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:01,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:31:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-02-05 11:31:02,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-02-05 11:31:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 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 11:31:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-02-05 11:31:02,045 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 30 [2025-02-05 11:31:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:02,048 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-02-05 11:31:02,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 11:31:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-02-05 11:31:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 11:31:02,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:02,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:02,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:31:02,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:02,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:02,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1677983148, now seen corresponding path program 1 times [2025-02-05 11:31:02,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:02,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804530779] [2025-02-05 11:31:02,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:02,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:02,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 11:31:02,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 11:31:02,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:02,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:31:02,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804530779] [2025-02-05 11:31:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804530779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:31:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989025286] [2025-02-05 11:31:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:02,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:02,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:02,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:02,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:02,300 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 11:31:03,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:03,038 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-02-05 11:31:03,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:03,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 96 [2025-02-05 11:31:03,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:03,042 INFO L225 Difference]: With dead ends: 1199 [2025-02-05 11:31:03,043 INFO L226 Difference]: Without dead ends: 789 [2025-02-05 11:31:03,046 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 11:31:03,046 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:03,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:31:03,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-02-05 11:31:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-02-05 11:31:03,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 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 11:31:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-02-05 11:31:03,076 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 96 [2025-02-05 11:31:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:03,076 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-02-05 11:31:03,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 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 11:31:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-02-05 11:31:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-05 11:31:03,078 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:03,078 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:03,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 11:31:03,078 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:03,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:03,078 INFO L85 PathProgramCache]: Analyzing trace with hash 694296906, now seen corresponding path program 1 times [2025-02-05 11:31:03,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:03,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413764635] [2025-02-05 11:31:03,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:03,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-05 11:31:03,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-05 11:31:03,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:03,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:31:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:03,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413764635] [2025-02-05 11:31:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413764635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:03,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:31:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934693324] [2025-02-05 11:31:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:03,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:03,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:03,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:03,307 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 11:31:03,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:03,909 INFO L93 Difference]: Finished difference Result 2316 states and 3182 transitions. [2025-02-05 11:31:03,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:03,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 100 [2025-02-05 11:31:03,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:03,914 INFO L225 Difference]: With dead ends: 2316 [2025-02-05 11:31:03,914 INFO L226 Difference]: Without dead ends: 1529 [2025-02-05 11:31:03,915 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 11:31:03,916 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:03,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-02-05 11:31:03,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1526. [2025-02-05 11:31:03,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 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 11:31:03,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-02-05 11:31:03,966 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 100 [2025-02-05 11:31:03,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:03,966 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-02-05 11:31:03,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 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 11:31:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-02-05 11:31:03,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 11:31:03,968 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:03,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:03,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:31:03,968 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:03,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:03,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1021594365, now seen corresponding path program 1 times [2025-02-05 11:31:03,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:03,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958010124] [2025-02-05 11:31:03,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:03,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:03,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 11:31:04,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 11:31:04,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:04,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:04,121 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:31:04,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958010124] [2025-02-05 11:31:04,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958010124] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:04,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:04,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:04,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977016974] [2025-02-05 11:31:04,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:04,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:04,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:04,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:04,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:04,123 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 11:31:04,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:04,703 INFO L93 Difference]: Finished difference Result 3257 states and 4125 transitions. [2025-02-05 11:31:04,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:04,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 157 [2025-02-05 11:31:04,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:04,709 INFO L225 Difference]: With dead ends: 3257 [2025-02-05 11:31:04,709 INFO L226 Difference]: Without dead ends: 1917 [2025-02-05 11:31:04,710 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 11:31:04,711 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 205 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:04,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 11:31:04,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-02-05 11:31:04,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-02-05 11:31:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 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 11:31:04,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2025-02-05 11:31:04,735 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 157 [2025-02-05 11:31:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:04,736 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2025-02-05 11:31:04,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 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 11:31:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2025-02-05 11:31:04,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-02-05 11:31:04,738 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:04,738 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:31:04,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:31:04,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:04,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:04,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1367180039, now seen corresponding path program 1 times [2025-02-05 11:31:04,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:04,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460407148] [2025-02-05 11:31:04,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:04,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:04,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-05 11:31:04,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-05 11:31:04,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:04,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:04,924 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-02-05 11:31:04,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460407148] [2025-02-05 11:31:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460407148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372000060] [2025-02-05 11:31:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:04,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:04,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:04,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:04,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:04,926 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 11:31:05,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:05,555 INFO L93 Difference]: Finished difference Result 4389 states and 5592 transitions. [2025-02-05 11:31:05,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:05,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 212 [2025-02-05 11:31:05,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:05,562 INFO L225 Difference]: With dead ends: 4389 [2025-02-05 11:31:05,562 INFO L226 Difference]: Without dead ends: 2661 [2025-02-05 11:31:05,564 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 11:31:05,565 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 167 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:05,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-02-05 11:31:05,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-02-05 11:31:05,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.235198702351987) internal successors, (3046), 2466 states have internal predecessors, (3046), 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 11:31:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3046 transitions. [2025-02-05 11:31:05,626 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3046 transitions. Word has length 212 [2025-02-05 11:31:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:05,626 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3046 transitions. [2025-02-05 11:31:05,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 11:31:05,626 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3046 transitions. [2025-02-05 11:31:05,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-02-05 11:31:05,628 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:05,628 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:31:05,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:31:05,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:05,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:05,629 INFO L85 PathProgramCache]: Analyzing trace with hash -942966344, now seen corresponding path program 1 times [2025-02-05 11:31:05,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:05,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072221430] [2025-02-05 11:31:05,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:05,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:05,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-05 11:31:05,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-05 11:31:05,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:05,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:05,849 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:31:05,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:05,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072221430] [2025-02-05 11:31:05,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072221430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:05,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:05,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:05,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117053380] [2025-02-05 11:31:05,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:05,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:05,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:05,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:05,852 INFO L87 Difference]: Start difference. First operand 2467 states and 3046 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 11:31:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:06,521 INFO L93 Difference]: Finished difference Result 6409 states and 8063 transitions. [2025-02-05 11:31:06,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:06,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 218 [2025-02-05 11:31:06,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:06,532 INFO L225 Difference]: With dead ends: 6409 [2025-02-05 11:31:06,532 INFO L226 Difference]: Without dead ends: 3944 [2025-02-05 11:31:06,535 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 11:31:06,535 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 200 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:06,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 271 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-02-05 11:31:06,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3941. [2025-02-05 11:31:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3940 states have (on average 1.232233502538071) internal successors, (4855), 3940 states have internal predecessors, (4855), 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 11:31:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 4855 transitions. [2025-02-05 11:31:06,593 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 4855 transitions. Word has length 218 [2025-02-05 11:31:06,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:06,594 INFO L471 AbstractCegarLoop]: Abstraction has 3941 states and 4855 transitions. [2025-02-05 11:31:06,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 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 11:31:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 4855 transitions. [2025-02-05 11:31:06,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2025-02-05 11:31:06,598 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:06,598 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:31:06,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:31:06,598 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:06,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:06,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1638709759, now seen corresponding path program 1 times [2025-02-05 11:31:06,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:06,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159360380] [2025-02-05 11:31:06,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:06,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:06,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes. [2025-02-05 11:31:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements. [2025-02-05 11:31:06,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:06,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:31:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:06,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159360380] [2025-02-05 11:31:06,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159360380] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:06,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:06,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:06,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538413871] [2025-02-05 11:31:06,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:06,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:31:06,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:06,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:31:06,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:31:06,839 INFO L87 Difference]: Start difference. First operand 3941 states and 4855 transitions. Second operand has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 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 11:31:07,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:07,836 INFO L93 Difference]: Finished difference Result 12154 states and 15362 transitions. [2025-02-05 11:31:07,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:31:07,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 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 257 [2025-02-05 11:31:07,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:07,859 INFO L225 Difference]: With dead ends: 12154 [2025-02-05 11:31:07,860 INFO L226 Difference]: Without dead ends: 8399 [2025-02-05 11:31:07,865 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 11:31:07,866 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 290 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:07,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 90 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 11:31:07,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8399 states. [2025-02-05 11:31:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8399 to 8395. [2025-02-05 11:31:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8395 states, 8394 states have (on average 1.2446985942339766) internal successors, (10448), 8394 states have internal predecessors, (10448), 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 11:31:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8395 states to 8395 states and 10448 transitions. [2025-02-05 11:31:08,010 INFO L78 Accepts]: Start accepts. Automaton has 8395 states and 10448 transitions. Word has length 257 [2025-02-05 11:31:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:08,011 INFO L471 AbstractCegarLoop]: Abstraction has 8395 states and 10448 transitions. [2025-02-05 11:31:08,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.25) internal successors, (257), 3 states have internal predecessors, (257), 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 11:31:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 8395 states and 10448 transitions. [2025-02-05 11:31:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2025-02-05 11:31:08,014 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:08,015 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:31:08,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:31:08,015 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:08,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1811769232, now seen corresponding path program 1 times [2025-02-05 11:31:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168078163] [2025-02-05 11:31:08,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:08,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:08,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-02-05 11:31:08,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-02-05 11:31:08,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:08,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-02-05 11:31:08,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:08,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168078163] [2025-02-05 11:31:08,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168078163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:08,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:08,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:08,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340780478] [2025-02-05 11:31:08,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:08,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:08,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:08,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:08,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:08,214 INFO L87 Difference]: Start difference. First operand 8395 states and 10448 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 11:31:08,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:08,830 INFO L93 Difference]: Finished difference Result 17334 states and 21902 transitions. [2025-02-05 11:31:08,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:08,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 266 [2025-02-05 11:31:08,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:08,859 INFO L225 Difference]: With dead ends: 17334 [2025-02-05 11:31:08,862 INFO L226 Difference]: Without dead ends: 10235 [2025-02-05 11:31:08,870 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 11:31:08,871 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 193 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:08,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 152 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:08,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10235 states. [2025-02-05 11:31:08,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10235 to 10235. [2025-02-05 11:31:08,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10235 states, 10234 states have (on average 1.2205393785421146) internal successors, (12491), 10234 states have internal predecessors, (12491), 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 11:31:09,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10235 states to 10235 states and 12491 transitions. [2025-02-05 11:31:09,005 INFO L78 Accepts]: Start accepts. Automaton has 10235 states and 12491 transitions. Word has length 266 [2025-02-05 11:31:09,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:09,005 INFO L471 AbstractCegarLoop]: Abstraction has 10235 states and 12491 transitions. [2025-02-05 11:31:09,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 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 11:31:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 10235 states and 12491 transitions. [2025-02-05 11:31:09,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-02-05 11:31:09,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:09,011 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:31:09,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 11:31:09,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:09,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:09,012 INFO L85 PathProgramCache]: Analyzing trace with hash -716806899, now seen corresponding path program 1 times [2025-02-05 11:31:09,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:09,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382986686] [2025-02-05 11:31:09,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:09,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 11:31:09,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 11:31:09,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:09,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 11:31:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382986686] [2025-02-05 11:31:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382986686] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:31:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983295014] [2025-02-05 11:31:09,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:09,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:31:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:31:09,408 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 11:31:09,417 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 11:31:09,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-02-05 11:31:09,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-02-05 11:31:09,514 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:09,514 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:09,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 11:31:09,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:31:09,823 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 11:31:09,823 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 11:31:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-05 11:31:09,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983295014] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-05 11:31:09,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-05 11:31:09,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-02-05 11:31:09,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771144343] [2025-02-05 11:31:09,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:09,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:09,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:09,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:09,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:31:09,891 INFO L87 Difference]: Start difference. First operand 10235 states and 12491 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 11:31:10,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:10,550 INFO L93 Difference]: Finished difference Result 21199 states and 26245 transitions. [2025-02-05 11:31:10,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:10,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 268 [2025-02-05 11:31:10,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:10,568 INFO L225 Difference]: With dead ends: 21199 [2025-02-05 11:31:10,569 INFO L226 Difference]: Without dead ends: 12260 [2025-02-05 11:31:10,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 534 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:31:10,578 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 206 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:10,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 135 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:10,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12260 states. [2025-02-05 11:31:10,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12260 to 11708. [2025-02-05 11:31:10,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11708 states, 11707 states have (on average 1.2194413598701632) internal successors, (14276), 11707 states have internal predecessors, (14276), 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 11:31:10,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11708 states to 11708 states and 14276 transitions. [2025-02-05 11:31:10,714 INFO L78 Accepts]: Start accepts. Automaton has 11708 states and 14276 transitions. Word has length 268 [2025-02-05 11:31:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:10,714 INFO L471 AbstractCegarLoop]: Abstraction has 11708 states and 14276 transitions. [2025-02-05 11:31:10,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 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 11:31:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 11708 states and 14276 transitions. [2025-02-05 11:31:10,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-02-05 11:31:10,720 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:10,720 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-02-05 11:31:10,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 11:31:10,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:31:10,925 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:10,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:10,926 INFO L85 PathProgramCache]: Analyzing trace with hash 30245470, now seen corresponding path program 1 times [2025-02-05 11:31:10,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:10,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049863493] [2025-02-05 11:31:10,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:10,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:10,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 11:31:10,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 11:31:10,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:10,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 108 proven. 122 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:31:11,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049863493] [2025-02-05 11:31:11,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049863493] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:31:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313918076] [2025-02-05 11:31:11,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:31:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:31:11,261 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 11:31:11,265 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 11:31:11,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-02-05 11:31:11,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-02-05 11:31:11,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:11,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:11,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:31:11,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:31:11,448 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 11:31:11,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:31:11,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313918076] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:11,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:31:11,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 11:31:11,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277778327] [2025-02-05 11:31:11,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:11,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:11,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:11,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:11,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:31:11,449 INFO L87 Difference]: Start difference. First operand 11708 states and 14276 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 11:31:12,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:12,092 INFO L93 Difference]: Finished difference Result 29484 states and 36155 transitions. [2025-02-05 11:31:12,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:12,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 292 [2025-02-05 11:31:12,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:12,121 INFO L225 Difference]: With dead ends: 29484 [2025-02-05 11:31:12,121 INFO L226 Difference]: Without dead ends: 18516 [2025-02-05 11:31:12,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 11:31:12,132 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 144 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:12,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 130 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18516 states. [2025-02-05 11:31:12,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18516 to 18516. [2025-02-05 11:31:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18516 states, 18515 states have (on average 1.194815014852822) internal successors, (22122), 18515 states have internal predecessors, (22122), 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 11:31:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18516 states to 18516 states and 22122 transitions. [2025-02-05 11:31:12,357 INFO L78 Accepts]: Start accepts. Automaton has 18516 states and 22122 transitions. Word has length 292 [2025-02-05 11:31:12,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:12,357 INFO L471 AbstractCegarLoop]: Abstraction has 18516 states and 22122 transitions. [2025-02-05 11:31:12,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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 11:31:12,357 INFO L276 IsEmpty]: Start isEmpty. Operand 18516 states and 22122 transitions. [2025-02-05 11:31:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-02-05 11:31:12,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:12,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:31:12,374 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 11:31:12,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:31:12,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:12,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:12,570 INFO L85 PathProgramCache]: Analyzing trace with hash 451977260, now seen corresponding path program 1 times [2025-02-05 11:31:12,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:12,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205215589] [2025-02-05 11:31:12,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:12,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:12,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-02-05 11:31:12,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-02-05 11:31:12,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:12,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-02-05 11:31:12,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:12,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205215589] [2025-02-05 11:31:12,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205215589] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:12,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:12,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327874013] [2025-02-05 11:31:12,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:12,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:12,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:12,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:12,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:12,699 INFO L87 Difference]: Start difference. First operand 18516 states and 22122 transitions. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 11:31:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:13,475 INFO L93 Difference]: Finished difference Result 34047 states and 40563 transitions. [2025-02-05 11:31:13,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 311 [2025-02-05 11:31:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:13,500 INFO L225 Difference]: With dead ends: 34047 [2025-02-05 11:31:13,501 INFO L226 Difference]: Without dead ends: 16454 [2025-02-05 11:31:13,516 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 11:31:13,517 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 140 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:13,517 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 149 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 11:31:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-02-05 11:31:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 12954. [2025-02-05 11:31:13,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12954 states, 12953 states have (on average 1.1559484289353819) internal successors, (14973), 12953 states have internal predecessors, (14973), 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 11:31:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12954 states to 12954 states and 14973 transitions. [2025-02-05 11:31:13,672 INFO L78 Accepts]: Start accepts. Automaton has 12954 states and 14973 transitions. Word has length 311 [2025-02-05 11:31:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:13,672 INFO L471 AbstractCegarLoop]: Abstraction has 12954 states and 14973 transitions. [2025-02-05 11:31:13,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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 11:31:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 12954 states and 14973 transitions. [2025-02-05 11:31:13,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-02-05 11:31:13,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:31:13,680 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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 11:31:13,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:31:13,681 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:31:13,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:31:13,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1011447186, now seen corresponding path program 1 times [2025-02-05 11:31:13,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:31:13,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751737110] [2025-02-05 11:31:13,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:31:13,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:31:13,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes. [2025-02-05 11:31:13,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements. [2025-02-05 11:31:13,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:31:13,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:31:13,830 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-02-05 11:31:13,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:31:13,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751737110] [2025-02-05 11:31:13,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751737110] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:31:13,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:31:13,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:31:13,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246504154] [2025-02-05 11:31:13,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:31:13,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:31:13,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:31:13,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:31:13,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:31:13,832 INFO L87 Difference]: Start difference. First operand 12954 states and 14973 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 11:31:14,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:31:14,474 INFO L93 Difference]: Finished difference Result 27570 states and 31974 transitions. [2025-02-05 11:31:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:31:14,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 334 [2025-02-05 11:31:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:31:14,475 INFO L225 Difference]: With dead ends: 27570 [2025-02-05 11:31:14,475 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 11:31:14,486 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 11:31:14,486 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 175 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:31:14,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 326 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 11:31:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 11:31:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 11:31:14,487 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 11:31:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 11:31:14,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 334 [2025-02-05 11:31:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:31:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 11:31:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 11:31:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 11:31:14,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 11:31:14,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 11:31:14,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:31:14,492 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:31:14,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 11:31:15,213 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 11:31:15,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:31:15 BoogieIcfgContainer [2025-02-05 11:31:15,228 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 11:31:15,229 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 11:31:15,229 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 11:31:15,229 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 11:31:15,229 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:31:00" (3/4) ... [2025-02-05 11:31:15,235 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 11:31:15,259 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 11:31:15,260 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 11:31:15,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 11:31:15,265 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 11:31:15,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 11:31:15,369 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 11:31:15,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 11:31:15,370 INFO L158 Benchmark]: Toolchain (without parser) took 17155.32ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 106.3MB in the beginning and 330.9MB in the end (delta: -224.6MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,370 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 11:31:15,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.29ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 63.2MB in the end (delta: 43.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.44ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 46.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,371 INFO L158 Benchmark]: Boogie Preprocessor took 157.83ms. Allocated memory is still 142.6MB. Free memory was 46.4MB in the beginning and 85.3MB in the end (delta: -38.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,371 INFO L158 Benchmark]: IcfgBuilder took 1435.41ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 37.4MB in the end (delta: 47.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,371 INFO L158 Benchmark]: TraceAbstraction took 14655.60ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 36.5MB in the beginning and 347.5MB in the end (delta: -311.0MB). Peak memory consumption was 301.9MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,371 INFO L158 Benchmark]: Witness Printer took 140.91ms. Allocated memory is still 612.4MB. Free memory was 347.5MB in the beginning and 330.9MB in the end (delta: 16.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 11:31:15,372 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.29ms. Allocated memory is still 142.6MB. Free memory was 106.3MB in the beginning and 63.2MB in the end (delta: 43.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.44ms. Allocated memory is still 142.6MB. Free memory was 63.2MB in the beginning and 46.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 157.83ms. Allocated memory is still 142.6MB. Free memory was 46.4MB in the beginning and 85.3MB in the end (delta: -38.9MB). Peak memory consumption was 21.7MB. Max. memory is 16.1GB. * IcfgBuilder took 1435.41ms. Allocated memory is still 142.6MB. Free memory was 85.3MB in the beginning and 37.4MB in the end (delta: 47.9MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14655.60ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 36.5MB in the beginning and 347.5MB in the end (delta: -311.0MB). Peak memory consumption was 301.9MB. Max. memory is 16.1GB. * Witness Printer took 140.91ms. Allocated memory is still 612.4MB. Free memory was 347.5MB in the beginning and 330.9MB in the end (delta: 16.6MB). 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: 106]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2207 SdHoareTripleChecker+Valid, 7.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2207 mSDsluCounter, 2501 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 294 mSDsCounter, 1536 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6969 IncrementalHoareTripleChecker+Invalid, 8505 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1536 mSolverCounterUnsat, 2207 mSDtfsCounter, 6969 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 859 GetRequests, 841 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18516occurred in iteration=10, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 4269 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 3101 NumberOfCodeBlocks, 3101 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 3354 ConstructedInterpolants, 0 QuantifiedInterpolants, 8596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 800 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 2190/2422 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: 1044]: Location Invariant Derived location invariant: (((((((((((a25 == 12) && (a4 == 1)) && (a29 <= 130)) || (((a29 <= 245) && (141 <= a29)) && (a4 == 1))) || (((a25 == 11) && (141 <= a29)) && (a4 == 1))) || (((a4 == 0) && (a25 <= 10)) && (a29 <= 245))) || ((a4 == 1) && (0 <= ((long long) a23 + 42)))) || (((a25 == 12) && (141 <= a29)) && (a4 == 1))) || ((a25 == 12) && (a4 == 0))) || ((a4 == 0) && (a23 <= 312))) || ((a25 <= 10) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 11:31:15,386 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