./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label40.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem19_label40.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 e138a285e39cee370658c394a82aa6106f1f1589e50dc2e37a5e2dc34c4d4ddf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:27:11,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:27:11,598 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:27:11,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:27:11,603 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:27:11,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:27:11,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:27:11,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:27:11,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:27:11,628 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:27:11,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:27:11,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:27:11,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:27:11,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:27:11,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:27:11,630 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:27:11,630 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:27:11,630 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:27:11,631 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:27:11,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:27:11,631 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 -> e138a285e39cee370658c394a82aa6106f1f1589e50dc2e37a5e2dc34c4d4ddf [2025-01-09 00:27:11,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:27:11,863 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:27:11,865 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:27:11,866 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:27:11,866 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:27:11,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label40.c [2025-01-09 00:27:13,053 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01a9943cb/50122449c09542e79f8ab293cc164f46/FLAG3cd1c5a5f [2025-01-09 00:27:13,667 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:27:13,668 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label40.c [2025-01-09 00:27:13,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01a9943cb/50122449c09542e79f8ab293cc164f46/FLAG3cd1c5a5f [2025-01-09 00:27:14,144 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/01a9943cb/50122449c09542e79f8ab293cc164f46 [2025-01-09 00:27:14,146 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:27:14,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:27:14,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:27:14,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:27:14,157 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:27:14,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:14" (1/1) ... [2025-01-09 00:27:14,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e325633 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:14, skipping insertion in model container [2025-01-09 00:27:14,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:27:14" (1/1) ... [2025-01-09 00:27:14,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:27:14,510 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/Problem19_label40.c[6144,6157] [2025-01-09 00:27:15,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:27:15,213 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:27:15,232 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/Problem19_label40.c[6144,6157] [2025-01-09 00:27:15,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:27:15,703 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:27:15,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15 WrapperNode [2025-01-09 00:27:15,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:27:15,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:27:15,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:27:15,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:27:15,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:15,783 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:16,338 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9428 [2025-01-09 00:27:16,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:27:16,340 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:27:16,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:27:16,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:27:16,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:16,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:16,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:16,717 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 00:27:16,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:16,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:16,987 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:17,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:17,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:17,065 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:17,095 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:17,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:27:17,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:27:17,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:27:17,204 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:27:17,205 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (1/1) ... [2025-01-09 00:27:17,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:27:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:27:17,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:27:17,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:27:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:27:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:27:17,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:27:17,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:27:17,313 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:27:17,319 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:27:23,165 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2025-01-09 00:27:23,165 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:27:23,198 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:27:23,198 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:27:23,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:23 BoogieIcfgContainer [2025-01-09 00:27:23,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:27:23,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:27:23,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:27:23,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:27:23,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:27:14" (1/3) ... [2025-01-09 00:27:23,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2185b345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:23, skipping insertion in model container [2025-01-09 00:27:23,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:27:15" (2/3) ... [2025-01-09 00:27:23,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2185b345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:27:23, skipping insertion in model container [2025-01-09 00:27:23,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:27:23" (3/3) ... [2025-01-09 00:27:23,206 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem19_label40.c [2025-01-09 00:27:23,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:27:23,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem19_label40.c that has 1 procedures, 1748 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:27:23,297 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:27:23,307 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;@45f9959a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:27:23,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:27:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:23,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-01-09 00:27:23,321 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:23,322 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:23,322 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:23,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash 2006201642, now seen corresponding path program 1 times [2025-01-09 00:27:23,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:23,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560421279] [2025-01-09 00:27:23,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:23,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:23,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 00:27:23,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 00:27:23,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:23,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:23,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:27:23,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:23,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560421279] [2025-01-09 00:27:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560421279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:23,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:23,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:27:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646369680] [2025-01-09 00:27:23,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:23,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:27:23,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:23,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:27:23,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:23,667 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8694158075601375) internal successors, (3264), 1747 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:29,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:27:29,244 INFO L93 Difference]: Finished difference Result 4919 states and 9310 transitions. [2025-01-09 00:27:29,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:27:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 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 46 [2025-01-09 00:27:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:27:29,276 INFO L225 Difference]: With dead ends: 4919 [2025-01-09 00:27:29,276 INFO L226 Difference]: Without dead ends: 3107 [2025-01-09 00:27:29,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:29,285 INFO L435 NwaCegarLoop]: 1278 mSDtfsCounter, 1507 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 4638 mSolverCounterSat, 1110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 5748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1110 IncrementalHoareTripleChecker+Valid, 4638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:27:29,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1507 Valid, 1459 Invalid, 5748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1110 Valid, 4638 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2025-01-09 00:27:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3107 states. [2025-01-09 00:27:29,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3107 to 3106. [2025-01-09 00:27:29,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 1.652818035426731) internal successors, (5132), 3105 states have internal predecessors, (5132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:29,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 5132 transitions. [2025-01-09 00:27:29,388 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 5132 transitions. Word has length 46 [2025-01-09 00:27:29,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:27:29,389 INFO L471 AbstractCegarLoop]: Abstraction has 3106 states and 5132 transitions. [2025-01-09 00:27:29,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 5132 transitions. [2025-01-09 00:27:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 00:27:29,391 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:29,391 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:29,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:27:29,392 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:29,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -194926243, now seen corresponding path program 1 times [2025-01-09 00:27:29,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:29,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132675890] [2025-01-09 00:27:29,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:29,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 00:27:29,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 00:27:29,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:29,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:27:29,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:29,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132675890] [2025-01-09 00:27:29,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132675890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:29,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:29,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:27:29,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690184087] [2025-01-09 00:27:29,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:29,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:27:29,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:29,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:27:29,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:27:29,728 INFO L87 Difference]: Start difference. First operand 3106 states and 5132 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:38,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:27:38,683 INFO L93 Difference]: Finished difference Result 10391 states and 16943 transitions. [2025-01-09 00:27:38,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:27:38,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 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 115 [2025-01-09 00:27:38,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:27:38,731 INFO L225 Difference]: With dead ends: 10391 [2025-01-09 00:27:38,735 INFO L226 Difference]: Without dead ends: 7287 [2025-01-09 00:27:38,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:27:38,745 INFO L435 NwaCegarLoop]: 1846 mSDtfsCounter, 4208 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 11122 mSolverCounterSat, 1405 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4208 SdHoareTripleChecker+Valid, 2112 SdHoareTripleChecker+Invalid, 12527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1405 IncrementalHoareTripleChecker+Valid, 11122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:27:38,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4208 Valid, 2112 Invalid, 12527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1405 Valid, 11122 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2025-01-09 00:27:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7287 states. [2025-01-09 00:27:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7287 to 7236. [2025-01-09 00:27:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7236 states, 7235 states have (on average 1.5214927436074637) internal successors, (11008), 7235 states have internal predecessors, (11008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:38,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 11008 transitions. [2025-01-09 00:27:38,951 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 11008 transitions. Word has length 115 [2025-01-09 00:27:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:27:38,952 INFO L471 AbstractCegarLoop]: Abstraction has 7236 states and 11008 transitions. [2025-01-09 00:27:38,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:38,953 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 11008 transitions. [2025-01-09 00:27:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-01-09 00:27:38,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:38,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:38,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:27:38,963 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:38,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:38,964 INFO L85 PathProgramCache]: Analyzing trace with hash -173427106, now seen corresponding path program 1 times [2025-01-09 00:27:38,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:38,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924276003] [2025-01-09 00:27:38,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:38,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:39,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 281 statements into 1 equivalence classes. [2025-01-09 00:27:39,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 281 of 281 statements. [2025-01-09 00:27:39,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:39,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:39,532 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:27:39,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:39,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924276003] [2025-01-09 00:27:39,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924276003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:39,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:39,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:27:39,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213657838] [2025-01-09 00:27:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:39,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:27:39,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:39,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:27:39,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:27:39,536 INFO L87 Difference]: Start difference. First operand 7236 states and 11008 transitions. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:44,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:27:44,440 INFO L93 Difference]: Finished difference Result 13136 states and 20668 transitions. [2025-01-09 00:27:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:27:44,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-01-09 00:27:44,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:27:44,465 INFO L225 Difference]: With dead ends: 13136 [2025-01-09 00:27:44,465 INFO L226 Difference]: Without dead ends: 7236 [2025-01-09 00:27:44,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:27:44,483 INFO L435 NwaCegarLoop]: 1767 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5712 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 5720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:27:44,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1946 Invalid, 5720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5712 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2025-01-09 00:27:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7236 states. [2025-01-09 00:27:44,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7236 to 7236. [2025-01-09 00:27:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7236 states, 7235 states have (on average 1.5202487906012438) internal successors, (10999), 7235 states have internal predecessors, (10999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7236 states to 7236 states and 10999 transitions. [2025-01-09 00:27:44,579 INFO L78 Accepts]: Start accepts. Automaton has 7236 states and 10999 transitions. Word has length 281 [2025-01-09 00:27:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:27:44,580 INFO L471 AbstractCegarLoop]: Abstraction has 7236 states and 10999 transitions. [2025-01-09 00:27:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7236 states and 10999 transitions. [2025-01-09 00:27:44,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 599 [2025-01-09 00:27:44,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:44,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:44,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:27:44,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:44,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash -778106631, now seen corresponding path program 1 times [2025-01-09 00:27:44,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:44,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642502221] [2025-01-09 00:27:44,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:44,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:44,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 598 statements into 1 equivalence classes. [2025-01-09 00:27:44,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 598 of 598 statements. [2025-01-09 00:27:44,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:44,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-01-09 00:27:45,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:45,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642502221] [2025-01-09 00:27:45,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642502221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:45,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:45,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:27:45,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000198937] [2025-01-09 00:27:45,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:45,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:27:45,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:45,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:27:45,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:45,016 INFO L87 Difference]: Start difference. First operand 7236 states and 10999 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:27:49,673 INFO L93 Difference]: Finished difference Result 15842 states and 24472 transitions. [2025-01-09 00:27:49,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:27:49,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 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 598 [2025-01-09 00:27:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:27:49,707 INFO L225 Difference]: With dead ends: 15842 [2025-01-09 00:27:49,710 INFO L226 Difference]: Without dead ends: 9973 [2025-01-09 00:27:49,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:49,717 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 1396 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1396 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 5598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:27:49,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1396 Valid, 752 Invalid, 5598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 00:27:49,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9973 states. [2025-01-09 00:27:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9973 to 9969. [2025-01-09 00:27:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9969 states, 9968 states have (on average 1.3901484751203852) internal successors, (13857), 9968 states have internal predecessors, (13857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:49,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9969 states to 9969 states and 13857 transitions. [2025-01-09 00:27:49,983 INFO L78 Accepts]: Start accepts. Automaton has 9969 states and 13857 transitions. Word has length 598 [2025-01-09 00:27:49,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:27:49,984 INFO L471 AbstractCegarLoop]: Abstraction has 9969 states and 13857 transitions. [2025-01-09 00:27:49,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:49,985 INFO L276 IsEmpty]: Start isEmpty. Operand 9969 states and 13857 transitions. [2025-01-09 00:27:49,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-01-09 00:27:49,990 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:49,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:49,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:27:49,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:49,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:49,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1705569313, now seen corresponding path program 1 times [2025-01-09 00:27:49,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:49,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542471213] [2025-01-09 00:27:49,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:49,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:50,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-09 00:27:50,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-09 00:27:50,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:50,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:50,356 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-09 00:27:50,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:50,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542471213] [2025-01-09 00:27:50,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542471213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:50,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:27:50,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:27:50,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175649445] [2025-01-09 00:27:50,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:50,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:27:50,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:50,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:27:50,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:50,362 INFO L87 Difference]: Start difference. First operand 9969 states and 13857 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:55,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:27:55,714 INFO L93 Difference]: Finished difference Result 26933 states and 38507 transitions. [2025-01-09 00:27:55,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:27:55,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 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 601 [2025-01-09 00:27:55,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:27:55,766 INFO L225 Difference]: With dead ends: 26933 [2025-01-09 00:27:55,770 INFO L226 Difference]: Without dead ends: 18331 [2025-01-09 00:27:55,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:27:55,789 INFO L435 NwaCegarLoop]: 711 mSDtfsCounter, 2119 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 5113 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2119 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 5547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:27:55,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2119 Valid, 980 Invalid, 5547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5113 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 00:27:55,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18331 states. [2025-01-09 00:27:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18331 to 18329. [2025-01-09 00:27:56,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18329 states, 18328 states have (on average 1.378601047577477) internal successors, (25267), 18328 states have internal predecessors, (25267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:56,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18329 states to 18329 states and 25267 transitions. [2025-01-09 00:27:56,187 INFO L78 Accepts]: Start accepts. Automaton has 18329 states and 25267 transitions. Word has length 601 [2025-01-09 00:27:56,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:27:56,192 INFO L471 AbstractCegarLoop]: Abstraction has 18329 states and 25267 transitions. [2025-01-09 00:27:56,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:27:56,192 INFO L276 IsEmpty]: Start isEmpty. Operand 18329 states and 25267 transitions. [2025-01-09 00:27:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2025-01-09 00:27:56,210 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:27:56,211 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:27:56,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:27:56,211 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:27:56,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:27:56,212 INFO L85 PathProgramCache]: Analyzing trace with hash -14837202, now seen corresponding path program 1 times [2025-01-09 00:27:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:27:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971749617] [2025-01-09 00:27:56,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:56,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:27:56,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 00:27:56,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 00:27:56,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:56,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:57,556 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 87 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:27:57,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:27:57,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971749617] [2025-01-09 00:27:57,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971749617] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:27:57,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863832852] [2025-01-09 00:27:57,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:27:57,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:27:57,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:27:57,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:27:57,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:27:57,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes. [2025-01-09 00:27:57,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements. [2025-01-09 00:27:57,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:27:57,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:27:57,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:27:57,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:27:57,853 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-01-09 00:27:57,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:27:57,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863832852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:27:57,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:27:57,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-09 00:27:57,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724829315] [2025-01-09 00:27:57,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:27:57,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:27:57,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:27:57,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:27:57,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:27:57,856 INFO L87 Difference]: Start difference. First operand 18329 states and 25267 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:03,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:03,297 INFO L93 Difference]: Finished difference Result 51713 states and 72347 transitions. [2025-01-09 00:28:03,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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 615 [2025-01-09 00:28:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:03,346 INFO L225 Difference]: With dead ends: 51713 [2025-01-09 00:28:03,347 INFO L226 Difference]: Without dead ends: 34751 [2025-01-09 00:28:03,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 615 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:28:03,367 INFO L435 NwaCegarLoop]: 1960 mSDtfsCounter, 1675 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4894 mSolverCounterSat, 1117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1675 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 6011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1117 IncrementalHoareTripleChecker+Valid, 4894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:03,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1675 Valid, 2067 Invalid, 6011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1117 Valid, 4894 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 00:28:03,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34751 states. [2025-01-09 00:28:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34751 to 34728. [2025-01-09 00:28:03,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34728 states, 34727 states have (on average 1.3551415325251246) internal successors, (47060), 34727 states have internal predecessors, (47060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34728 states to 34728 states and 47060 transitions. [2025-01-09 00:28:03,701 INFO L78 Accepts]: Start accepts. Automaton has 34728 states and 47060 transitions. Word has length 615 [2025-01-09 00:28:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:03,701 INFO L471 AbstractCegarLoop]: Abstraction has 34728 states and 47060 transitions. [2025-01-09 00:28:03,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:03,702 INFO L276 IsEmpty]: Start isEmpty. Operand 34728 states and 47060 transitions. [2025-01-09 00:28:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-01-09 00:28:03,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:03,705 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:03,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:28:03,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:03,906 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:03,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash 811307727, now seen corresponding path program 1 times [2025-01-09 00:28:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:03,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624173480] [2025-01-09 00:28:03,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:03,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:03,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-01-09 00:28:03,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-01-09 00:28:03,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:03,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-09 00:28:04,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624173480] [2025-01-09 00:28:04,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624173480] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:04,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:04,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:28:04,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840598462] [2025-01-09 00:28:04,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:04,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:04,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:04,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:04,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:04,179 INFO L87 Difference]: Start difference. First operand 34728 states and 47060 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:09,719 INFO L93 Difference]: Finished difference Result 98323 states and 134131 transitions. [2025-01-09 00:28:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 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 622 [2025-01-09 00:28:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:09,795 INFO L225 Difference]: With dead ends: 98323 [2025-01-09 00:28:09,796 INFO L226 Difference]: Without dead ends: 64962 [2025-01-09 00:28:09,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:28:09,828 INFO L435 NwaCegarLoop]: 1427 mSDtfsCounter, 1356 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 4206 mSolverCounterSat, 1424 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 5630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1424 IncrementalHoareTripleChecker+Valid, 4206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:09,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1693 Invalid, 5630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1424 Valid, 4206 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 00:28:09,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64962 states. [2025-01-09 00:28:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64962 to 62214. [2025-01-09 00:28:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62214 states, 62213 states have (on average 1.2403516949833635) internal successors, (77166), 62213 states have internal predecessors, (77166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:10,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62214 states to 62214 states and 77166 transitions. [2025-01-09 00:28:10,529 INFO L78 Accepts]: Start accepts. Automaton has 62214 states and 77166 transitions. Word has length 622 [2025-01-09 00:28:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 62214 states and 77166 transitions. [2025-01-09 00:28:10,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 2 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 62214 states and 77166 transitions. [2025-01-09 00:28:10,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-01-09 00:28:10,535 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:10,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:10,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:28:10,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:10,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1372619755, now seen corresponding path program 1 times [2025-01-09 00:28:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549467675] [2025-01-09 00:28:10,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:10,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:10,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-01-09 00:28:10,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-01-09 00:28:10,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:10,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 102 proven. 44 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:28:11,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549467675] [2025-01-09 00:28:11,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549467675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:28:11,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768153915] [2025-01-09 00:28:11,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:28:11,266 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:28:11,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:28:11,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-01-09 00:28:11,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-01-09 00:28:11,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:11,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:11,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 743 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:28:11,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:28:11,575 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 00:28:11,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:28:11,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768153915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:11,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:28:11,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 00:28:11,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747502107] [2025-01-09 00:28:11,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:11,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:11,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:11,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:11,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:28:11,578 INFO L87 Difference]: Start difference. First operand 62214 states and 77166 transitions. Second operand has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:16,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:16,481 INFO L93 Difference]: Finished difference Result 123167 states and 153151 transitions. [2025-01-09 00:28:16,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:16,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 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 637 [2025-01-09 00:28:16,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:16,553 INFO L225 Difference]: With dead ends: 123167 [2025-01-09 00:28:16,553 INFO L226 Difference]: Without dead ends: 62320 [2025-01-09 00:28:16,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 637 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:28:16,574 INFO L435 NwaCegarLoop]: 2768 mSDtfsCounter, 1425 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4069 mSolverCounterSat, 1722 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 2940 SdHoareTripleChecker+Invalid, 5791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1722 IncrementalHoareTripleChecker+Valid, 4069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:16,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 2940 Invalid, 5791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1722 Valid, 4069 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:28:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62320 states. [2025-01-09 00:28:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62320 to 59507. [2025-01-09 00:28:17,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59507 states, 59506 states have (on average 1.1772090209390649) internal successors, (70051), 59506 states have internal predecessors, (70051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59507 states to 59507 states and 70051 transitions. [2025-01-09 00:28:17,054 INFO L78 Accepts]: Start accepts. Automaton has 59507 states and 70051 transitions. Word has length 637 [2025-01-09 00:28:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:17,055 INFO L471 AbstractCegarLoop]: Abstraction has 59507 states and 70051 transitions. [2025-01-09 00:28:17,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.0) internal successors, (594), 3 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 59507 states and 70051 transitions. [2025-01-09 00:28:17,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 744 [2025-01-09 00:28:17,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:17,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:17,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:28:17,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:17,263 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:17,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:17,264 INFO L85 PathProgramCache]: Analyzing trace with hash 210704292, now seen corresponding path program 1 times [2025-01-09 00:28:17,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:17,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324326053] [2025-01-09 00:28:17,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:17,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:17,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 743 statements into 1 equivalence classes. [2025-01-09 00:28:17,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 743 of 743 statements. [2025-01-09 00:28:17,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:17,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 87 proven. 37 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2025-01-09 00:28:18,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324326053] [2025-01-09 00:28:18,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324326053] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:28:18,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483000833] [2025-01-09 00:28:18,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:18,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:28:18,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:28:18,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:28:18,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 743 statements into 1 equivalence classes. [2025-01-09 00:28:18,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 743 of 743 statements. [2025-01-09 00:28:18,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:18,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:18,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:28:18,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:28:18,308 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-01-09 00:28:18,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:28:18,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483000833] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:18,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:28:18,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-09 00:28:18,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158252455] [2025-01-09 00:28:18,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:18,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:18,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:18,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:18,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:28:18,310 INFO L87 Difference]: Start difference. First operand 59507 states and 70051 transitions. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:23,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:23,949 INFO L93 Difference]: Finished difference Result 149166 states and 177567 transitions. [2025-01-09 00:28:23,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:23,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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 743 [2025-01-09 00:28:23,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:24,043 INFO L225 Difference]: With dead ends: 149166 [2025-01-09 00:28:24,043 INFO L226 Difference]: Without dead ends: 91026 [2025-01-09 00:28:24,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 742 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 00:28:24,087 INFO L435 NwaCegarLoop]: 3123 mSDtfsCounter, 1437 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 5042 mSolverCounterSat, 903 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 3295 SdHoareTripleChecker+Invalid, 5945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 903 IncrementalHoareTripleChecker+Valid, 5042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:24,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 3295 Invalid, 5945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [903 Valid, 5042 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-01-09 00:28:24,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91026 states. [2025-01-09 00:28:24,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91026 to 89559. [2025-01-09 00:28:25,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89559 states, 89558 states have (on average 1.1535652872998503) internal successors, (103311), 89558 states have internal predecessors, (103311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89559 states to 89559 states and 103311 transitions. [2025-01-09 00:28:25,158 INFO L78 Accepts]: Start accepts. Automaton has 89559 states and 103311 transitions. Word has length 743 [2025-01-09 00:28:25,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:25,159 INFO L471 AbstractCegarLoop]: Abstraction has 89559 states and 103311 transitions. [2025-01-09 00:28:25,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 89559 states and 103311 transitions. [2025-01-09 00:28:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2025-01-09 00:28:25,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:25,169 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:25,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:28:25,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:25,369 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:25,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:25,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1131460604, now seen corresponding path program 1 times [2025-01-09 00:28:25,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:25,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055836064] [2025-01-09 00:28:25,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:25,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-01-09 00:28:25,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-01-09 00:28:25,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:25,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:26,107 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 113 proven. 18 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:28:26,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:26,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055836064] [2025-01-09 00:28:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055836064] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:28:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533467012] [2025-01-09 00:28:26,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:26,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:28:26,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:28:26,110 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:28:26,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:28:26,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 839 statements into 1 equivalence classes. [2025-01-09 00:28:26,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 839 of 839 statements. [2025-01-09 00:28:26,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:26,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:26,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:28:26,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:28:26,443 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2025-01-09 00:28:26,444 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:28:26,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533467012] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:26,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:28:26,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-09 00:28:26,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210627858] [2025-01-09 00:28:26,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:26,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:28:26,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:26,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:28:26,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:28:26,446 INFO L87 Difference]: Start difference. First operand 89559 states and 103311 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:30,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:30,835 INFO L93 Difference]: Finished difference Result 209164 states and 243687 transitions. [2025-01-09 00:28:30,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:28:30,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 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 839 [2025-01-09 00:28:30,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:30,976 INFO L225 Difference]: With dead ends: 209164 [2025-01-09 00:28:30,977 INFO L226 Difference]: Without dead ends: 120972 [2025-01-09 00:28:31,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 842 GetRequests, 838 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-01-09 00:28:31,040 INFO L435 NwaCegarLoop]: 3017 mSDtfsCounter, 1482 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 3711 mSolverCounterSat, 1636 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1482 SdHoareTripleChecker+Valid, 3203 SdHoareTripleChecker+Invalid, 5347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1636 IncrementalHoareTripleChecker+Valid, 3711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:31,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1482 Valid, 3203 Invalid, 5347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1636 Valid, 3711 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 00:28:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120972 states. [2025-01-09 00:28:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120972 to 114138. [2025-01-09 00:28:31,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114138 states, 114137 states have (on average 1.1346014000718434) internal successors, (129500), 114137 states have internal predecessors, (129500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:32,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114138 states to 114138 states and 129500 transitions. [2025-01-09 00:28:32,016 INFO L78 Accepts]: Start accepts. Automaton has 114138 states and 129500 transitions. Word has length 839 [2025-01-09 00:28:32,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:28:32,017 INFO L471 AbstractCegarLoop]: Abstraction has 114138 states and 129500 transitions. [2025-01-09 00:28:32,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:32,017 INFO L276 IsEmpty]: Start isEmpty. Operand 114138 states and 129500 transitions. [2025-01-09 00:28:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 907 [2025-01-09 00:28:32,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:28:32,184 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:28:32,197 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:28:32,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 00:28:32,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:28:32,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:28:32,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2126858023, now seen corresponding path program 1 times [2025-01-09 00:28:32,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:28:32,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142302206] [2025-01-09 00:28:32,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:28:32,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:28:32,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 906 statements into 1 equivalence classes. [2025-01-09 00:28:32,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 906 of 906 statements. [2025-01-09 00:28:32,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:28:32,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:28:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 765 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 590 trivial. 0 not checked. [2025-01-09 00:28:32,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:28:32,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142302206] [2025-01-09 00:28:32,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142302206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:28:32,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:28:32,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 00:28:32,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110970774] [2025-01-09 00:28:32,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:28:32,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:28:32,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:28:32,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:28:32,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:28:32,982 INFO L87 Difference]: Start difference. First operand 114138 states and 129500 transitions. Second operand has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:28:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:28:41,521 INFO L93 Difference]: Finished difference Result 334788 states and 387317 transitions. [2025-01-09 00:28:41,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:28:41,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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 906 [2025-01-09 00:28:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:28:41,837 INFO L225 Difference]: With dead ends: 334788 [2025-01-09 00:28:41,837 INFO L226 Difference]: Without dead ends: 222017 [2025-01-09 00:28:41,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:28:41,941 INFO L435 NwaCegarLoop]: 2597 mSDtfsCounter, 2863 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 10102 mSolverCounterSat, 1457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2863 SdHoareTripleChecker+Valid, 3065 SdHoareTripleChecker+Invalid, 11559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1457 IncrementalHoareTripleChecker+Valid, 10102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:28:41,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2863 Valid, 3065 Invalid, 11559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1457 Valid, 10102 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2025-01-09 00:28:42,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222017 states. [2025-01-09 00:28:44,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222017 to 219276.