./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label39.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/Problem01_label39.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 e51d0f9be42091dddfe189cc9c123d5edcf142be4fec1d914e1bef518aa4756e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:53:00,856 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:53:00,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:53:00,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:53:00,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:53:00,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:53:00,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:53:00,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:53:00,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:53:00,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:53:00,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:53:00,911 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:53:00,912 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:00,912 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:00,912 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:00,913 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:53:00,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:53:00,913 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 -> e51d0f9be42091dddfe189cc9c123d5edcf142be4fec1d914e1bef518aa4756e [2025-01-08 22:53:01,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:53:01,191 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:53:01,192 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:53:01,193 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:53:01,193 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:53:01,194 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label39.c [2025-01-08 22:53:02,359 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/715b9f3a9/b5171fd7db9941dbbc920f11cca1d8c2/FLAGf4a60b93b [2025-01-08 22:53:02,679 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:53:02,680 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label39.c [2025-01-08 22:53:02,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/715b9f3a9/b5171fd7db9941dbbc920f11cca1d8c2/FLAGf4a60b93b [2025-01-08 22:53:02,935 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/715b9f3a9/b5171fd7db9941dbbc920f11cca1d8c2 [2025-01-08 22:53:02,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:53:02,938 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:53:02,939 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:02,939 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:53:02,942 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:53:02,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:02" (1/1) ... [2025-01-08 22:53:02,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79da9237 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:02, skipping insertion in model container [2025-01-08 22:53:02,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:02" (1/1) ... [2025-01-08 22:53:02,965 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:53:03,208 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/Problem01_label39.c[21959,21972] [2025-01-08 22:53:03,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:03,241 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:53:03,315 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/Problem01_label39.c[21959,21972] [2025-01-08 22:53:03,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:03,331 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:53:03,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03 WrapperNode [2025-01-08 22:53:03,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:03,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:03,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:53:03,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:53:03,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,400 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-01-08 22:53:03,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:03,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:53:03,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:53:03,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:53:03,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,442 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:53:03,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,446 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,463 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,494 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:53:03,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:53:03,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:53:03,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:53:03,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (1/1) ... [2025-01-08 22:53:03,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:03,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:03,527 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:53:03,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:53:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:53:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:53:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:53:03,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:53:03,602 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:53:03,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:53:04,335 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-01-08 22:53:04,335 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:53:04,347 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:53:04,349 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:53:04,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:04 BoogieIcfgContainer [2025-01-08 22:53:04,349 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:53:04,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:53:04,351 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:53:04,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:53:04,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:53:02" (1/3) ... [2025-01-08 22:53:04,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790d0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:04, skipping insertion in model container [2025-01-08 22:53:04,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:03" (2/3) ... [2025-01-08 22:53:04,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5790d0e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:04, skipping insertion in model container [2025-01-08 22:53:04,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:04" (3/3) ... [2025-01-08 22:53:04,357 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label39.c [2025-01-08 22:53:04,368 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:53:04,370 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label39.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:53:04,405 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:53:04,412 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;@60a7d863, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:53:04,413 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:53:04,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:04,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-08 22:53:04,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:04,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:04,423 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:04,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:04,426 INFO L85 PathProgramCache]: Analyzing trace with hash -90151777, now seen corresponding path program 1 times [2025-01-08 22:53:04,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:04,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305483836] [2025-01-08 22:53:04,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:04,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:04,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-08 22:53:04,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-08 22:53:04,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:04,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:04,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:04,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305483836] [2025-01-08 22:53:04,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305483836] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:04,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:04,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674403077] [2025-01-08 22:53:04,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:04,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:04,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:04,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:04,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:04,858 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:05,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:05,543 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-01-08 22:53:05,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:05,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 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 132 [2025-01-08 22:53:05,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:05,555 INFO L225 Difference]: With dead ends: 528 [2025-01-08 22:53:05,555 INFO L226 Difference]: Without dead ends: 266 [2025-01-08 22:53:05,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:05,565 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 53 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:05,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 66 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:53:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-01-08 22:53:05,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-01-08 22:53:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:05,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-01-08 22:53:05,615 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 132 [2025-01-08 22:53:05,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:05,618 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-01-08 22:53:05,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:05,618 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-01-08 22:53:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-08 22:53:05,623 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:05,624 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:53:05,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:53:05,624 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:05,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:05,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1269228786, now seen corresponding path program 1 times [2025-01-08 22:53:05,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:05,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144494906] [2025-01-08 22:53:05,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:05,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-08 22:53:05,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-08 22:53:05,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:05,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:05,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144494906] [2025-01-08 22:53:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144494906] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916268003] [2025-01-08 22:53:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:05,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:05,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:05,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:05,859 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:06,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:06,184 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-01-08 22:53:06,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:06,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 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 137 [2025-01-08 22:53:06,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:06,187 INFO L225 Difference]: With dead ends: 792 [2025-01-08 22:53:06,187 INFO L226 Difference]: Without dead ends: 528 [2025-01-08 22:53:06,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:06,188 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 149 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:06,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 31 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-01-08 22:53:06,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-01-08 22:53:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.366223908918406) internal successors, (720), 527 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 720 transitions. [2025-01-08 22:53:06,209 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 720 transitions. Word has length 137 [2025-01-08 22:53:06,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:06,209 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 720 transitions. [2025-01-08 22:53:06,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 2 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:06,209 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 720 transitions. [2025-01-08 22:53:06,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-08 22:53:06,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:06,215 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:53:06,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:53:06,215 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:06,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1621931102, now seen corresponding path program 1 times [2025-01-08 22:53:06,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:06,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24397038] [2025-01-08 22:53:06,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:06,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:06,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-08 22:53:06,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-08 22:53:06,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:06,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:06,419 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:06,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:06,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24397038] [2025-01-08 22:53:06,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24397038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:06,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:06,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:06,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481713926] [2025-01-08 22:53:06,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:06,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:06,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:06,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:06,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:06,420 INFO L87 Difference]: Start difference. First operand 528 states and 720 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:06,897 INFO L93 Difference]: Finished difference Result 1578 states and 2155 transitions. [2025-01-08 22:53:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-01-08 22:53:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:06,901 INFO L225 Difference]: With dead ends: 1578 [2025-01-08 22:53:06,901 INFO L226 Difference]: Without dead ends: 1052 [2025-01-08 22:53:06,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:06,902 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 127 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:06,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 66 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:06,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-01-08 22:53:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2025-01-08 22:53:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2630434782608695) internal successors, (1162), 920 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1162 transitions. [2025-01-08 22:53:06,927 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1162 transitions. Word has length 145 [2025-01-08 22:53:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:06,927 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1162 transitions. [2025-01-08 22:53:06,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:06,927 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1162 transitions. [2025-01-08 22:53:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-08 22:53:06,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:06,930 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-01-08 22:53:06,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:53:06,930 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:06,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1439176294, now seen corresponding path program 1 times [2025-01-08 22:53:06,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:06,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021438854] [2025-01-08 22:53:06,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:06,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:06,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-08 22:53:06,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-08 22:53:06,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:06,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:07,112 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:07,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:07,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021438854] [2025-01-08 22:53:07,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021438854] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:07,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:07,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:07,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553602929] [2025-01-08 22:53:07,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:07,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:53:07,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:07,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:53:07,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:07,113 INFO L87 Difference]: Start difference. First operand 921 states and 1162 transitions. Second operand has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:07,557 INFO L93 Difference]: Finished difference Result 1971 states and 2465 transitions. [2025-01-08 22:53:07,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:53:07,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 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 149 [2025-01-08 22:53:07,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:07,561 INFO L225 Difference]: With dead ends: 1971 [2025-01-08 22:53:07,561 INFO L226 Difference]: Without dead ends: 1052 [2025-01-08 22:53:07,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:07,562 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 389 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:07,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 41 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:07,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2025-01-08 22:53:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 921. [2025-01-08 22:53:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.2565217391304349) internal successors, (1156), 920 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1156 transitions. [2025-01-08 22:53:07,578 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1156 transitions. Word has length 149 [2025-01-08 22:53:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:07,578 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1156 transitions. [2025-01-08 22:53:07,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.25) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1156 transitions. [2025-01-08 22:53:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-08 22:53:07,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:07,580 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 22:53:07,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:53:07,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:07,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:07,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1259167251, now seen corresponding path program 1 times [2025-01-08 22:53:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:07,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478443396] [2025-01-08 22:53:07,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:07,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-08 22:53:07,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-08 22:53:07,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:07,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:53:07,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:07,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478443396] [2025-01-08 22:53:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478443396] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:07,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599430224] [2025-01-08 22:53:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:07,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:07,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:07,669 INFO L87 Difference]: Start difference. First operand 921 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:08,003 INFO L93 Difference]: Finished difference Result 2495 states and 3134 transitions. [2025-01-08 22:53:08,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:08,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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 158 [2025-01-08 22:53:08,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:08,008 INFO L225 Difference]: With dead ends: 2495 [2025-01-08 22:53:08,008 INFO L226 Difference]: Without dead ends: 1576 [2025-01-08 22:53:08,009 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:08,013 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 137 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:08,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 23 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:08,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-01-08 22:53:08,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1314. [2025-01-08 22:53:08,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 1313 states have (on average 1.2673267326732673) internal successors, (1664), 1313 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1664 transitions. [2025-01-08 22:53:08,063 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1664 transitions. Word has length 158 [2025-01-08 22:53:08,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:08,063 INFO L471 AbstractCegarLoop]: Abstraction has 1314 states and 1664 transitions. [2025-01-08 22:53:08,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1664 transitions. [2025-01-08 22:53:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-08 22:53:08,065 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:08,065 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:08,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:53:08,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:08,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:08,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1048759513, now seen corresponding path program 1 times [2025-01-08 22:53:08,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:08,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363552124] [2025-01-08 22:53:08,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:08,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:08,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-08 22:53:08,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-08 22:53:08,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:08,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:08,237 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:53:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363552124] [2025-01-08 22:53:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363552124] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229284471] [2025-01-08 22:53:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:08,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:08,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:08,238 INFO L87 Difference]: Start difference. First operand 1314 states and 1664 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:08,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:08,526 INFO L93 Difference]: Finished difference Result 2757 states and 3499 transitions. [2025-01-08 22:53:08,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:08,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 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 174 [2025-01-08 22:53:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:08,531 INFO L225 Difference]: With dead ends: 2757 [2025-01-08 22:53:08,531 INFO L226 Difference]: Without dead ends: 1445 [2025-01-08 22:53:08,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:08,533 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 108 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:08,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 62 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:08,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-01-08 22:53:08,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2025-01-08 22:53:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.255540166204986) internal successors, (1813), 1444 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:08,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1813 transitions. [2025-01-08 22:53:08,556 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1813 transitions. Word has length 174 [2025-01-08 22:53:08,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:08,556 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1813 transitions. [2025-01-08 22:53:08,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 2 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:08,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1813 transitions. [2025-01-08 22:53:08,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-08 22:53:08,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:08,558 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:08,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:53:08,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 626683423, now seen corresponding path program 1 times [2025-01-08 22:53:08,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:08,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010669069] [2025-01-08 22:53:08,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:08,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:08,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-08 22:53:08,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-08 22:53:08,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:08,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:53:08,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:08,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010669069] [2025-01-08 22:53:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010669069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064232111] [2025-01-08 22:53:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:08,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:53:08,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:08,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:53:08,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:08,824 INFO L87 Difference]: Start difference. First operand 1445 states and 1813 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:09,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:09,331 INFO L93 Difference]: Finished difference Result 3281 states and 4065 transitions. [2025-01-08 22:53:09,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:53:09,332 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 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 178 [2025-01-08 22:53:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:09,337 INFO L225 Difference]: With dead ends: 3281 [2025-01-08 22:53:09,337 INFO L226 Difference]: Without dead ends: 1838 [2025-01-08 22:53:09,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:09,338 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 352 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:09,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 59 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2025-01-08 22:53:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2025-01-08 22:53:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.2303634232121923) internal successors, (2099), 1706 states have internal predecessors, (2099), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:09,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2025-01-08 22:53:09,363 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 178 [2025-01-08 22:53:09,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:09,363 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2025-01-08 22:53:09,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 3 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2025-01-08 22:53:09,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-01-08 22:53:09,365 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:09,365 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:09,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:53:09,366 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:09,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:09,366 INFO L85 PathProgramCache]: Analyzing trace with hash 909843959, now seen corresponding path program 1 times [2025-01-08 22:53:09,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:09,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633166914] [2025-01-08 22:53:09,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:09,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:09,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-08 22:53:09,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:53:09,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:09,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 65 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:09,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633166914] [2025-01-08 22:53:09,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633166914] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:53:09,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54668241] [2025-01-08 22:53:09,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:09,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:09,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:53:09,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:53:09,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-08 22:53:09,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-08 22:53:09,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:09,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:09,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:53:09,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:53:10,025 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-08 22:53:10,026 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:53:10,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54668241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:10,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:53:10,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 22:53:10,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189748736] [2025-01-08 22:53:10,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:10,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:10,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:10,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:10,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:53:10,027 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:10,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:10,359 INFO L93 Difference]: Finished difference Result 4067 states and 4997 transitions. [2025-01-08 22:53:10,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:10,360 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-01-08 22:53:10,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:10,365 INFO L225 Difference]: With dead ends: 4067 [2025-01-08 22:53:10,365 INFO L226 Difference]: Without dead ends: 2231 [2025-01-08 22:53:10,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:53:10,367 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:10,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 205 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:10,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-01-08 22:53:10,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 2100. [2025-01-08 22:53:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1281562648880419) internal successors, (2368), 2099 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2368 transitions. [2025-01-08 22:53:10,394 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2368 transitions. Word has length 195 [2025-01-08 22:53:10,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:10,394 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2368 transitions. [2025-01-08 22:53:10,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2368 transitions. [2025-01-08 22:53:10,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-08 22:53:10,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:10,397 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 22:53:10,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:53:10,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:10,601 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:10,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1638455581, now seen corresponding path program 1 times [2025-01-08 22:53:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981839338] [2025-01-08 22:53:10,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:10,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-08 22:53:10,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-08 22:53:10,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:10,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:53:10,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:10,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981839338] [2025-01-08 22:53:10,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981839338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:10,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:10,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:10,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540181988] [2025-01-08 22:53:10,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:10,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:53:10,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:10,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:53:10,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:10,901 INFO L87 Difference]: Start difference. First operand 2100 states and 2368 transitions. Second operand has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:11,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:11,347 INFO L93 Difference]: Finished difference Result 4591 states and 5163 transitions. [2025-01-08 22:53:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:53:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 212 [2025-01-08 22:53:11,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:11,354 INFO L225 Difference]: With dead ends: 4591 [2025-01-08 22:53:11,354 INFO L226 Difference]: Without dead ends: 2493 [2025-01-08 22:53:11,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:53:11,357 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 347 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:11,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 32 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:11,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-01-08 22:53:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2100. [2025-01-08 22:53:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1129109099571224) internal successors, (2336), 2099 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:11,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2336 transitions. [2025-01-08 22:53:11,391 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2336 transitions. Word has length 212 [2025-01-08 22:53:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:11,391 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2336 transitions. [2025-01-08 22:53:11,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:11,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2336 transitions. [2025-01-08 22:53:11,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2025-01-08 22:53:11,395 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:11,395 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 22:53:11,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:53:11,395 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:11,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:11,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1606288616, now seen corresponding path program 1 times [2025-01-08 22:53:11,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:11,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177905135] [2025-01-08 22:53:11,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:11,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:11,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-08 22:53:11,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-08 22:53:11,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:11,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-08 22:53:11,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:11,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177905135] [2025-01-08 22:53:11,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177905135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:11,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:11,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:11,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285825540] [2025-01-08 22:53:11,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:11,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:11,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:11,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:11,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:11,535 INFO L87 Difference]: Start difference. First operand 2100 states and 2336 transitions. Second operand has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:11,862 INFO L93 Difference]: Finished difference Result 4460 states and 4943 transitions. [2025-01-08 22:53:11,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:11,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 255 [2025-01-08 22:53:11,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:11,868 INFO L225 Difference]: With dead ends: 4460 [2025-01-08 22:53:11,869 INFO L226 Difference]: Without dead ends: 2362 [2025-01-08 22:53:11,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:11,871 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:11,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-01-08 22:53:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2231. [2025-01-08 22:53:11,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2231 states, 2230 states have (on average 1.0919282511210762) internal successors, (2435), 2230 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2435 transitions. [2025-01-08 22:53:11,900 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2435 transitions. Word has length 255 [2025-01-08 22:53:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 2231 states and 2435 transitions. [2025-01-08 22:53:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:11,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2435 transitions. [2025-01-08 22:53:11,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2025-01-08 22:53:11,904 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:11,904 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:11,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:53:11,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:11,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1946002396, now seen corresponding path program 1 times [2025-01-08 22:53:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:11,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792985049] [2025-01-08 22:53:11,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-08 22:53:11,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-08 22:53:11,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:11,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:12,246 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 197 proven. 35 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-08 22:53:12,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:12,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792985049] [2025-01-08 22:53:12,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792985049] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:53:12,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446860383] [2025-01-08 22:53:12,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:12,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:12,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:12,250 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:53:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:53:12,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 268 statements into 1 equivalence classes. [2025-01-08 22:53:12,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 268 of 268 statements. [2025-01-08 22:53:12,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:12,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:12,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:53:12,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:53:12,497 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-01-08 22:53:12,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:53:12,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446860383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:12,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:53:12,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 22:53:12,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926320149] [2025-01-08 22:53:12,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:12,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:12,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:12,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:12,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:53:12,499 INFO L87 Difference]: Start difference. First operand 2231 states and 2435 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:12,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:12,814 INFO L93 Difference]: Finished difference Result 5115 states and 5577 transitions. [2025-01-08 22:53:12,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:12,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2025-01-08 22:53:12,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:12,822 INFO L225 Difference]: With dead ends: 5115 [2025-01-08 22:53:12,823 INFO L226 Difference]: Without dead ends: 2886 [2025-01-08 22:53:12,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:53:12,826 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:12,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 169 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2025-01-08 22:53:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2624. [2025-01-08 22:53:12,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2623 states have (on average 1.0815859702630575) internal successors, (2837), 2623 states have internal predecessors, (2837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:12,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 2837 transitions. [2025-01-08 22:53:12,864 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 2837 transitions. Word has length 268 [2025-01-08 22:53:12,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:12,864 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 2837 transitions. [2025-01-08 22:53:12,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:12,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 2837 transitions. [2025-01-08 22:53:12,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-08 22:53:12,869 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:12,869 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-01-08 22:53:12,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:53:13,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:13,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:13,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:13,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1063352639, now seen corresponding path program 1 times [2025-01-08 22:53:13,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:13,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862524272] [2025-01-08 22:53:13,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:13,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:13,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-08 22:53:13,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-08 22:53:13,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:13,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 143 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-08 22:53:13,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:13,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862524272] [2025-01-08 22:53:13,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862524272] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:53:13,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326150679] [2025-01-08 22:53:13,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:13,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:13,431 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:53:13,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:53:13,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-08 22:53:13,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-08 22:53:13,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:13,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:13,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:53:13,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:53:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-01-08 22:53:13,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:53:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326150679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:53:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 22:53:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423612115] [2025-01-08 22:53:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:13,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:13,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:13,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:13,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:53:13,700 INFO L87 Difference]: Start difference. First operand 2624 states and 2837 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:13,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:13,948 INFO L93 Difference]: Finished difference Result 3017 states and 3246 transitions. [2025-01-08 22:53:13,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:13,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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 277 [2025-01-08 22:53:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:13,950 INFO L225 Difference]: With dead ends: 3017 [2025-01-08 22:53:13,950 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:53:13,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:53:13,952 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:13,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 27 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:13,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:53:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:53:13,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:53:13,953 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 277 [2025-01-08 22:53:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:13,953 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:53:13,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:53:13,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:53:13,956 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:53:13,962 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-08 22:53:14,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:53:14,163 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:14,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:53:14,308 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:53:14,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:53:14 BoogieIcfgContainer [2025-01-08 22:53:14,326 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:53:14,326 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:53:14,326 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:53:14,326 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:53:14,327 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:04" (3/4) ... [2025-01-08 22:53:14,328 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:53:14,340 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:53:14,341 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:53:14,341 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:53:14,342 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:53:14,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:53:14,442 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:53:14,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:53:14,443 INFO L158 Benchmark]: Toolchain (without parser) took 11505.18ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 103.6MB in the beginning and 297.6MB in the end (delta: -194.0MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2025-01-08 22:53:14,443 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:14,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.78ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 76.7MB in the end (delta: 26.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:53:14,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.79ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 71.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:53:14,445 INFO L158 Benchmark]: Boogie Preprocessor took 93.27ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 66.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:14,445 INFO L158 Benchmark]: RCFGBuilder took 851.42ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 51.8MB in the end (delta: 15.1MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2025-01-08 22:53:14,445 INFO L158 Benchmark]: TraceAbstraction took 9975.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 51.1MB in the beginning and 310.1MB in the end (delta: -259.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:53:14,445 INFO L158 Benchmark]: Witness Printer took 115.96ms. Allocated memory is still 427.8MB. Free memory was 310.1MB in the beginning and 297.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:53:14,447 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.78ms. Allocated memory is still 142.6MB. Free memory was 103.6MB in the beginning and 76.7MB in the end (delta: 26.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.79ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 71.3MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.27ms. Allocated memory is still 142.6MB. Free memory was 71.3MB in the beginning and 66.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 851.42ms. Allocated memory is still 142.6MB. Free memory was 66.8MB in the beginning and 51.8MB in the end (delta: 15.1MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9975.20ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 51.1MB in the beginning and 310.1MB in the end (delta: -259.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Witness Printer took 115.96ms. Allocated memory is still 427.8MB. Free memory was 310.1MB in the beginning and 297.6MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 582]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 12, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1870 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1870 mSDsluCounter, 960 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 74 mSDsCounter, 811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4375 IncrementalHoareTripleChecker+Invalid, 5186 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 811 mSolverCounterUnsat, 886 mSDtfsCounter, 4375 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 775 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2624occurred in iteration=11, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1572 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3020 NumberOfCodeBlocks, 3020 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3005 ConstructedInterpolants, 0 QuantifiedInterpolants, 9118 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1282 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 15 InterpolantComputations, 12 PerfectInterpolantSequences, 1685/1822 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: (((((((((((5 == a16) && (14 <= a8)) && (a21 == 1)) && (a20 == 1)) || (((a21 == 1) && (a17 == 1)) && (a20 == 1))) || (((a21 == 1) && (a20 == 1)) && (15 <= a8))) || (((5 == a16) && (a17 == 1)) && (a20 == 1))) || (a16 == 6)) || ((((a20 <= 0) && (5 == a16)) && (14 <= a8)) && (a21 == 1))) || (((5 == a16) && (a21 == 1)) && (15 <= a8))) || (a16 < 5)) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:53:14,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE