./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label21.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label21.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 09d063705287b401285699bfa86431b1230e05d127a376405f72545cb8e31896 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:32:15,826 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:32:15,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:32:15,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:32:15,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:32:15,903 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:32:15,903 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:32:15,903 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:32:15,903 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:32:15,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:32:15,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:32:15,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:32:15,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:32:15,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:32:15,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:32:15,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:15,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:32:15,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:32:15,905 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/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 -> 09d063705287b401285699bfa86431b1230e05d127a376405f72545cb8e31896 [2025-03-03 10:32:16,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:32:16,128 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:32:16,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:32:16,131 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:32:16,131 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:32:16,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2025-03-03 10:32:17,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b618d6/ad2c1cf4f74f49e38cf4737bc2196892/FLAG421cdca26 [2025-03-03 10:32:17,516 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:32:17,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2025-03-03 10:32:17,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b618d6/ad2c1cf4f74f49e38cf4737bc2196892/FLAG421cdca26 [2025-03-03 10:32:17,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/325b618d6/ad2c1cf4f74f49e38cf4737bc2196892 [2025-03-03 10:32:17,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:32:17,542 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:32:17,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:17,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:32:17,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:32:17,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:17" (1/1) ... [2025-03-03 10:32:17,549 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37eaf57a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:17, skipping insertion in model container [2025-03-03 10:32:17,550 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:32:17" (1/1) ... [2025-03-03 10:32:17,583 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:32:17,705 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c[3545,3558] [2025-03-03 10:32:17,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:17,920 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:32:17,934 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label21.c[3545,3558] [2025-03-03 10:32:18,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:32:18,022 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:32:18,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18 WrapperNode [2025-03-03 10:32:18,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:32:18,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:18,025 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:32:18,025 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:32:18,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,129 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-03 10:32:18,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:32:18,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:32:18,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:32:18,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:32:18,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,211 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-03-03 10:32:18,211 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,211 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,264 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,268 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,278 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:32:18,279 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:32:18,279 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:32:18,279 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:32:18,280 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (1/1) ... [2025-03-03 10:32:18,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:32:18,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:18,305 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 10:32:18,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 10:32:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:32:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:32:18,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:32:18,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:32:18,368 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:32:18,369 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:32:19,427 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-03 10:32:19,427 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:32:19,449 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:32:19,449 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:32:19,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:19 BoogieIcfgContainer [2025-03-03 10:32:19,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:32:19,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:32:19,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:32:19,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:32:19,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:32:17" (1/3) ... [2025-03-03 10:32:19,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374d6c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:19, skipping insertion in model container [2025-03-03 10:32:19,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:32:18" (2/3) ... [2025-03-03 10:32:19,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374d6c37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:32:19, skipping insertion in model container [2025-03-03 10:32:19,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:19" (3/3) ... [2025-03-03 10:32:19,458 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label21.c [2025-03-03 10:32:19,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:32:19,472 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label21.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:32:19,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:32:19,528 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;@248bac3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:32:19,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:32:19,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 10:32:19,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:19,534 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] [2025-03-03 10:32:19,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:19,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1538943459, now seen corresponding path program 1 times [2025-03-03 10:32:19,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:19,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550438026] [2025-03-03 10:32:19,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:19,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:19,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-03 10:32:19,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 10:32:19,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:19,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:19,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:19,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:19,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550438026] [2025-03-03 10:32:19,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550438026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:19,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:19,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:19,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471198748] [2025-03-03 10:32:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:19,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:19,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:19,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:19,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:19,803 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-03-03 10:32:20,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:20,697 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-03-03 10:32:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:20,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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 24 [2025-03-03 10:32:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:20,706 INFO L225 Difference]: With dead ends: 769 [2025-03-03 10:32:20,706 INFO L226 Difference]: Without dead ends: 422 [2025-03-03 10:32:20,708 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-03-03 10:32:20,712 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 216 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:20,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 10:32:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-03-03 10:32:20,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-03-03 10:32:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-03-03 10:32:20,777 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 24 [2025-03-03 10:32:20,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:20,777 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-03-03 10:32:20,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 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-03-03 10:32:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-03-03 10:32:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-03 10:32:20,780 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:20,780 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:32:20,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:32:20,781 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:20,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash -874667523, now seen corresponding path program 1 times [2025-03-03 10:32:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:20,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768451295] [2025-03-03 10:32:20,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:20,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:20,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-03 10:32:20,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-03 10:32:20,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:20,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:21,017 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:21,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:21,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768451295] [2025-03-03 10:32:21,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768451295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:21,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:21,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:21,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495839017] [2025-03-03 10:32:21,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:21,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:21,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:21,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:21,022 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-03-03 10:32:21,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:21,671 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-03-03 10:32:21,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:21,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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 90 [2025-03-03 10:32:21,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:21,674 INFO L225 Difference]: With dead ends: 1199 [2025-03-03 10:32:21,674 INFO L226 Difference]: Without dead ends: 789 [2025-03-03 10:32:21,675 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-03-03 10:32:21,676 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:21,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:21,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-03-03 10:32:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-03-03 10:32:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:21,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-03-03 10:32:21,699 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 90 [2025-03-03 10:32:21,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:21,700 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-03-03 10:32:21,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 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-03-03 10:32:21,700 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-03-03 10:32:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 10:32:21,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:21,701 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:32:21,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:32:21,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:21,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 374243699, now seen corresponding path program 1 times [2025-03-03 10:32:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845810298] [2025-03-03 10:32:21,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:21,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-03 10:32:21,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 10:32:21,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:21,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:21,940 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845810298] [2025-03-03 10:32:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845810298] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:32:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816752105] [2025-03-03 10:32:21,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:21,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:21,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:21,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:21,942 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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-03-03 10:32:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:22,569 INFO L93 Difference]: Finished difference Result 2316 states and 3182 transitions. [2025-03-03 10:32:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:22,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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 94 [2025-03-03 10:32:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:22,574 INFO L225 Difference]: With dead ends: 2316 [2025-03-03 10:32:22,574 INFO L226 Difference]: Without dead ends: 1529 [2025-03-03 10:32:22,575 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-03-03 10:32:22,576 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:22,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-03-03 10:32:22,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1526. [2025-03-03 10:32:22,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:22,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-03-03 10:32:22,601 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 94 [2025-03-03 10:32:22,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:22,602 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-03-03 10:32:22,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 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-03-03 10:32:22,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-03-03 10:32:22,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 10:32:22,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:22,604 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:32:22,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:32:22,604 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:22,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:22,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1415848102, now seen corresponding path program 1 times [2025-03-03 10:32:22,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:22,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942688867] [2025-03-03 10:32:22,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:22,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:22,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 10:32:22,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 10:32:22,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:22,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:22,796 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:32:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942688867] [2025-03-03 10:32:22,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942688867] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:22,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:22,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:22,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704209498] [2025-03-03 10:32:22,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:22,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:22,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:22,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:22,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:22,798 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-03-03 10:32:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:23,393 INFO L93 Difference]: Finished difference Result 3257 states and 4125 transitions. [2025-03-03 10:32:23,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:23,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 151 [2025-03-03 10:32:23,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:23,402 INFO L225 Difference]: With dead ends: 3257 [2025-03-03 10:32:23,402 INFO L226 Difference]: Without dead ends: 1917 [2025-03-03 10:32:23,404 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-03-03 10:32:23,404 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 211 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:23,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:23,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-03-03 10:32:23,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-03-03 10:32:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2025-03-03 10:32:23,432 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 151 [2025-03-03 10:32:23,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:23,433 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2025-03-03 10:32:23,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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-03-03 10:32:23,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2025-03-03 10:32:23,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-03 10:32:23,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:23,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:23,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:32:23,436 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:23,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:23,436 INFO L85 PathProgramCache]: Analyzing trace with hash -567062192, now seen corresponding path program 1 times [2025-03-03 10:32:23,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:23,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397192282] [2025-03-03 10:32:23,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:23,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:23,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-03 10:32:23,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-03 10:32:23,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:23,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-03 10:32:23,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:23,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397192282] [2025-03-03 10:32:23,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397192282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:23,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:23,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:23,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810733408] [2025-03-03 10:32:23,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:23,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:23,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:23,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:23,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:23,682 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-03 10:32:24,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:24,309 INFO L93 Difference]: Finished difference Result 4747 states and 6092 transitions. [2025-03-03 10:32:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-03-03 10:32:24,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:24,318 INFO L225 Difference]: With dead ends: 4747 [2025-03-03 10:32:24,318 INFO L226 Difference]: Without dead ends: 3019 [2025-03-03 10:32:24,319 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-03-03 10:32:24,320 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 183 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:24,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 346 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:24,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2025-03-03 10:32:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3019. [2025-03-03 10:32:24,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3019 states, 3018 states have (on average 1.2196819085487078) internal successors, (3681), 3018 states have internal predecessors, (3681), 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-03-03 10:32:24,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3019 states to 3019 states and 3681 transitions. [2025-03-03 10:32:24,356 INFO L78 Accepts]: Start accepts. Automaton has 3019 states and 3681 transitions. Word has length 206 [2025-03-03 10:32:24,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:24,356 INFO L471 AbstractCegarLoop]: Abstraction has 3019 states and 3681 transitions. [2025-03-03 10:32:24,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-03 10:32:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3681 transitions. [2025-03-03 10:32:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-03 10:32:24,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:24,358 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:24,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:32:24,358 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:24,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:24,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1042624319, now seen corresponding path program 1 times [2025-03-03 10:32:24,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:24,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288903006] [2025-03-03 10:32:24,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:24,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-03 10:32:24,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-03 10:32:24,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:24,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:24,540 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-03 10:32:24,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:24,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288903006] [2025-03-03 10:32:24,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288903006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:24,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:24,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:24,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536901372] [2025-03-03 10:32:24,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:24,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:24,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:24,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:24,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:24,542 INFO L87 Difference]: Start difference. First operand 3019 states and 3681 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-03 10:32:25,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:25,182 INFO L93 Difference]: Finished difference Result 7150 states and 8838 transitions. [2025-03-03 10:32:25,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:25,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-03 10:32:25,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:25,194 INFO L225 Difference]: With dead ends: 7150 [2025-03-03 10:32:25,194 INFO L226 Difference]: Without dead ends: 4317 [2025-03-03 10:32:25,197 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-03-03 10:32:25,198 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 172 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:25,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 383 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:25,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4317 states. [2025-03-03 10:32:25,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4317 to 4308. [2025-03-03 10:32:25,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4308 states, 4307 states have (on average 1.1968887856977015) internal successors, (5155), 4307 states have internal predecessors, (5155), 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-03-03 10:32:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4308 states to 4308 states and 5155 transitions. [2025-03-03 10:32:25,255 INFO L78 Accepts]: Start accepts. Automaton has 4308 states and 5155 transitions. Word has length 212 [2025-03-03 10:32:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:25,255 INFO L471 AbstractCegarLoop]: Abstraction has 4308 states and 5155 transitions. [2025-03-03 10:32:25,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 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-03-03 10:32:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 4308 states and 5155 transitions. [2025-03-03 10:32:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-03 10:32:25,259 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:25,259 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:32:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:32:25,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 780608133, now seen corresponding path program 1 times [2025-03-03 10:32:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72268120] [2025-03-03 10:32:25,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:25,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 283 statements into 1 equivalence classes. [2025-03-03 10:32:25,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 283 of 283 statements. [2025-03-03 10:32:25,309 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:25,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 256 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 10:32:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:25,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72268120] [2025-03-03 10:32:25,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72268120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:25,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:25,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878346670] [2025-03-03 10:32:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:25,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:25,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:25,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:25,496 INFO L87 Difference]: Start difference. First operand 4308 states and 5155 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-03-03 10:32:26,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:26,088 INFO L93 Difference]: Finished difference Result 9549 states and 11608 transitions. [2025-03-03 10:32:26,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:26,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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 283 [2025-03-03 10:32:26,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:26,101 INFO L225 Difference]: With dead ends: 9549 [2025-03-03 10:32:26,101 INFO L226 Difference]: Without dead ends: 5427 [2025-03-03 10:32:26,106 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-03-03 10:32:26,107 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:26,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 342 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:26,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5427 states. [2025-03-03 10:32:26,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5427 to 5045. [2025-03-03 10:32:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5045 states, 5044 states have (on average 1.1964710547184774) internal successors, (6035), 5044 states have internal predecessors, (6035), 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-03-03 10:32:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 6035 transitions. [2025-03-03 10:32:26,172 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 6035 transitions. Word has length 283 [2025-03-03 10:32:26,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 5045 states and 6035 transitions. [2025-03-03 10:32:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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-03-03 10:32:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 6035 transitions. [2025-03-03 10:32:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2025-03-03 10:32:26,176 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:26,177 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-03 10:32:26,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:32:26,177 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1292531198, now seen corresponding path program 1 times [2025-03-03 10:32:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550938720] [2025-03-03 10:32:26,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:26,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-03-03 10:32:26,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-03-03 10:32:26,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:26,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-03 10:32:26,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:26,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550938720] [2025-03-03 10:32:26,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550938720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:26,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:26,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:26,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150817001] [2025-03-03 10:32:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:26,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:26,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:26,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:26,328 INFO L87 Difference]: Start difference. First operand 5045 states and 6035 transitions. Second operand has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-03-03 10:32:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:26,871 INFO L93 Difference]: Finished difference Result 10064 states and 12034 transitions. [2025-03-03 10:32:26,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:26,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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 286 [2025-03-03 10:32:26,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:26,882 INFO L225 Difference]: With dead ends: 10064 [2025-03-03 10:32:26,882 INFO L226 Difference]: Without dead ends: 5021 [2025-03-03 10:32:26,887 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-03-03 10:32:26,887 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 159 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:26,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 149 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:26,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5021 states. [2025-03-03 10:32:26,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5021 to 5019. [2025-03-03 10:32:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5019 states, 5018 states have (on average 1.143682742128338) internal successors, (5739), 5018 states have internal predecessors, (5739), 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-03-03 10:32:26,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5019 states to 5019 states and 5739 transitions. [2025-03-03 10:32:26,945 INFO L78 Accepts]: Start accepts. Automaton has 5019 states and 5739 transitions. Word has length 286 [2025-03-03 10:32:26,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:26,945 INFO L471 AbstractCegarLoop]: Abstraction has 5019 states and 5739 transitions. [2025-03-03 10:32:26,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 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-03-03 10:32:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 5019 states and 5739 transitions. [2025-03-03 10:32:26,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 10:32:26,951 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:26,952 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:26,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:32:26,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:26,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:26,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1613486918, now seen corresponding path program 1 times [2025-03-03 10:32:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:26,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437923021] [2025-03-03 10:32:26,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:26,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:26,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 10:32:26,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 10:32:26,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:26,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-03 10:32:27,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:27,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437923021] [2025-03-03 10:32:27,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437923021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:27,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:27,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:27,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097428336] [2025-03-03 10:32:27,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:27,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:27,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:27,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:27,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:27,141 INFO L87 Difference]: Start difference. First operand 5019 states and 5739 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:27,735 INFO L93 Difference]: Finished difference Result 11324 states and 12981 transitions. [2025-03-03 10:32:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-03-03 10:32:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:27,750 INFO L225 Difference]: With dead ends: 11324 [2025-03-03 10:32:27,750 INFO L226 Difference]: Without dead ends: 6307 [2025-03-03 10:32:27,755 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-03-03 10:32:27,756 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 195 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:27,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 308 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6307 states. [2025-03-03 10:32:27,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6307 to 5387. [2025-03-03 10:32:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5387 states, 5386 states have (on average 1.1438915707389528) internal successors, (6161), 5386 states have internal predecessors, (6161), 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-03-03 10:32:27,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5387 states to 5387 states and 6161 transitions. [2025-03-03 10:32:27,823 INFO L78 Accepts]: Start accepts. Automaton has 5387 states and 6161 transitions. Word has length 349 [2025-03-03 10:32:27,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:27,823 INFO L471 AbstractCegarLoop]: Abstraction has 5387 states and 6161 transitions. [2025-03-03 10:32:27,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:32:27,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5387 states and 6161 transitions. [2025-03-03 10:32:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2025-03-03 10:32:27,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:27,831 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:32:27,831 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:27,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:27,831 INFO L85 PathProgramCache]: Analyzing trace with hash 474376014, now seen corresponding path program 1 times [2025-03-03 10:32:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:27,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219894461] [2025-03-03 10:32:27,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:27,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:27,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 396 statements into 1 equivalence classes. [2025-03-03 10:32:27,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 396 of 396 statements. [2025-03-03 10:32:27,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:27,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 414 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-03 10:32:28,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:28,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219894461] [2025-03-03 10:32:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219894461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:28,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:28,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103440653] [2025-03-03 10:32:28,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:28,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:32:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:28,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:32:28,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:32:28,068 INFO L87 Difference]: Start difference. First operand 5387 states and 6161 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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-03-03 10:32:29,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:29,064 INFO L93 Difference]: Finished difference Result 15948 states and 18260 transitions. [2025-03-03 10:32:29,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:32:29,065 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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 396 [2025-03-03 10:32:29,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:29,088 INFO L225 Difference]: With dead ends: 15948 [2025-03-03 10:32:29,088 INFO L226 Difference]: Without dead ends: 10563 [2025-03-03 10:32:29,094 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-03-03 10:32:29,095 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 225 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 1251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:29,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 85 Invalid, 1251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 10:32:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10563 states. [2025-03-03 10:32:29,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10563 to 10561. [2025-03-03 10:32:29,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10561 states, 10560 states have (on average 1.1388257575757577) internal successors, (12026), 10560 states have internal predecessors, (12026), 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-03-03 10:32:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10561 states to 10561 states and 12026 transitions. [2025-03-03 10:32:29,252 INFO L78 Accepts]: Start accepts. Automaton has 10561 states and 12026 transitions. Word has length 396 [2025-03-03 10:32:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:29,252 INFO L471 AbstractCegarLoop]: Abstraction has 10561 states and 12026 transitions. [2025-03-03 10:32:29,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 3 states have internal predecessors, (286), 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-03-03 10:32:29,253 INFO L276 IsEmpty]: Start isEmpty. Operand 10561 states and 12026 transitions. [2025-03-03 10:32:29,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2025-03-03 10:32:29,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:29,265 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:29,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:32:29,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:29,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:29,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1252147015, now seen corresponding path program 1 times [2025-03-03 10:32:29,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:29,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928651437] [2025-03-03 10:32:29,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:29,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:29,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 449 statements into 1 equivalence classes. [2025-03-03 10:32:29,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 449 of 449 statements. [2025-03-03 10:32:29,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:29,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 10:32:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:29,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928651437] [2025-03-03 10:32:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928651437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:29,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772902408] [2025-03-03 10:32:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:29,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:29,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:29,440 INFO L87 Difference]: Start difference. First operand 10561 states and 12026 transitions. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-03-03 10:32:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:30,100 INFO L93 Difference]: Finished difference Result 22219 states and 25412 transitions. [2025-03-03 10:32:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:30,101 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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 449 [2025-03-03 10:32:30,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:30,120 INFO L225 Difference]: With dead ends: 22219 [2025-03-03 10:32:30,120 INFO L226 Difference]: Without dead ends: 12400 [2025-03-03 10:32:30,128 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-03-03 10:32:30,129 INFO L435 NwaCegarLoop]: 341 mSDtfsCounter, 63 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:30,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 364 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 10:32:30,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2025-03-03 10:32:30,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 12032. [2025-03-03 10:32:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12032 states, 12031 states have (on average 1.1413847560468788) internal successors, (13732), 12031 states have internal predecessors, (13732), 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-03-03 10:32:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12032 states to 12032 states and 13732 transitions. [2025-03-03 10:32:30,246 INFO L78 Accepts]: Start accepts. Automaton has 12032 states and 13732 transitions. Word has length 449 [2025-03-03 10:32:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:30,247 INFO L471 AbstractCegarLoop]: Abstraction has 12032 states and 13732 transitions. [2025-03-03 10:32:30,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 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-03-03 10:32:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 12032 states and 13732 transitions. [2025-03-03 10:32:30,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-03 10:32:30,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:30,263 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:30,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:32:30,263 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:30,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:30,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1579187977, now seen corresponding path program 1 times [2025-03-03 10:32:30,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239352760] [2025-03-03 10:32:30,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:30,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-03 10:32:30,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-03 10:32:30,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:30,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:30,817 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 388 proven. 24 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 10:32:30,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239352760] [2025-03-03 10:32:30,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239352760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:30,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832999710] [2025-03-03 10:32:30,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:30,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:30,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:30,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:30,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 10:32:30,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-03 10:32:30,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-03 10:32:30,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:30,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:30,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 647 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:32:30,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 412 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-03-03 10:32:31,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832999710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:31,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:32:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895475306] [2025-03-03 10:32:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:31,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:31,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:31,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:31,151 INFO L87 Difference]: Start difference. First operand 12032 states and 13732 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-03-03 10:32:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:31,735 INFO L93 Difference]: Finished difference Result 25179 states and 28793 transitions. [2025-03-03 10:32:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:31,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 483 [2025-03-03 10:32:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:31,750 INFO L225 Difference]: With dead ends: 25179 [2025-03-03 10:32:31,750 INFO L226 Difference]: Without dead ends: 14073 [2025-03-03 10:32:31,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 482 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:31,759 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:31,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 83 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14073 states. [2025-03-03 10:32:31,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14073 to 12216. [2025-03-03 10:32:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12216 states, 12215 states have (on average 1.1421203438395415) internal successors, (13951), 12215 states have internal predecessors, (13951), 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-03-03 10:32:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12216 states to 12216 states and 13951 transitions. [2025-03-03 10:32:31,930 INFO L78 Accepts]: Start accepts. Automaton has 12216 states and 13951 transitions. Word has length 483 [2025-03-03 10:32:31,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:31,931 INFO L471 AbstractCegarLoop]: Abstraction has 12216 states and 13951 transitions. [2025-03-03 10:32:31,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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-03-03 10:32:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 12216 states and 13951 transitions. [2025-03-03 10:32:31,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-03 10:32:31,948 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:31,948 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:32:31,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:32:32,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 10:32:32,149 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:32,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:32,150 INFO L85 PathProgramCache]: Analyzing trace with hash -703039162, now seen corresponding path program 1 times [2025-03-03 10:32:32,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:32,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722901376] [2025-03-03 10:32:32,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:32,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:32,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-03 10:32:32,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-03 10:32:32,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:32,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:32,418 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 510 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-03 10:32:32,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:32,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722901376] [2025-03-03 10:32:32,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722901376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:32,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:32:32,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:32:32,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42110849] [2025-03-03 10:32:32,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:32,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:32,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:32,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:32,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:32:32,420 INFO L87 Difference]: Start difference. First operand 12216 states and 13951 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-03-03 10:32:32,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:32,982 INFO L93 Difference]: Finished difference Result 27577 states and 31571 transitions. [2025-03-03 10:32:32,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:32,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 484 [2025-03-03 10:32:32,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:33,002 INFO L225 Difference]: With dead ends: 27577 [2025-03-03 10:32:33,002 INFO L226 Difference]: Without dead ends: 16287 [2025-03-03 10:32:33,012 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-03-03 10:32:33,012 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:33,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 130 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:33,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16287 states. [2025-03-03 10:32:33,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16287 to 15917. [2025-03-03 10:32:33,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15917 states, 15916 states have (on average 1.128361397336014) internal successors, (17959), 15916 states have internal predecessors, (17959), 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-03-03 10:32:33,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15917 states to 15917 states and 17959 transitions. [2025-03-03 10:32:33,178 INFO L78 Accepts]: Start accepts. Automaton has 15917 states and 17959 transitions. Word has length 484 [2025-03-03 10:32:33,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:33,179 INFO L471 AbstractCegarLoop]: Abstraction has 15917 states and 17959 transitions. [2025-03-03 10:32:33,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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-03-03 10:32:33,179 INFO L276 IsEmpty]: Start isEmpty. Operand 15917 states and 17959 transitions. [2025-03-03 10:32:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2025-03-03 10:32:33,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:32:33,191 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:33,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:32:33,191 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:32:33,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:32:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1924273517, now seen corresponding path program 1 times [2025-03-03 10:32:33,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:32:33,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243707079] [2025-03-03 10:32:33,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:33,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:32:33,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-03 10:32:33,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-03 10:32:33,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:33,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:33,881 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 168 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-03 10:32:33,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:32:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243707079] [2025-03-03 10:32:33,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243707079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:32:33,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044809416] [2025-03-03 10:32:33,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:32:33,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:32:33,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:32:33,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 10:32:33,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 10:32:33,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 494 statements into 1 equivalence classes. [2025-03-03 10:32:34,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 494 of 494 statements. [2025-03-03 10:32:34,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:32:34,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:32:34,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:32:34,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:32:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2025-03-03 10:32:34,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:32:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044809416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:32:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:32:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-03 10:32:34,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856887220] [2025-03-03 10:32:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:32:34,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:32:34,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:32:34,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:32:34,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:34,139 INFO L87 Difference]: Start difference. First operand 15917 states and 17959 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-03-03 10:32:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:32:34,672 INFO L93 Difference]: Finished difference Result 18309 states and 20621 transitions. [2025-03-03 10:32:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:32:34,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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 494 [2025-03-03 10:32:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:32:34,675 INFO L225 Difference]: With dead ends: 18309 [2025-03-03 10:32:34,675 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 10:32:34,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 10:32:34,684 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 197 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:32:34,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 145 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:32:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 10:32:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 10:32:34,685 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-03-03 10:32:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 10:32:34,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 494 [2025-03-03 10:32:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:32:34,685 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 10:32:34,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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-03-03 10:32:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 10:32:34,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 10:32:34,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 10:32:34,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:32:34,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 10:32:34,891 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:32:34,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 10:32:35,998 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 10:32:36,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 10:32:36 BoogieIcfgContainer [2025-03-03 10:32:36,008 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 10:32:36,008 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 10:32:36,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 10:32:36,008 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 10:32:36,009 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:32:19" (3/4) ... [2025-03-03 10:32:36,010 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-03 10:32:36,024 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-03 10:32:36,027 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-03 10:32:36,028 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-03 10:32:36,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-03 10:32:36,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 10:32:36,149 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 10:32:36,149 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 10:32:36,150 INFO L158 Benchmark]: Toolchain (without parser) took 18608.26ms. Allocated memory was 142.6MB in the beginning and 780.1MB in the end (delta: 637.5MB). Free memory was 107.7MB in the beginning and 307.8MB in the end (delta: -200.1MB). Peak memory consumption was 439.5MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,150 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 10:32:36,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.25ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 65.1MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.06ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 48.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,151 INFO L158 Benchmark]: Boogie Preprocessor took 148.60ms. Allocated memory is still 142.6MB. Free memory was 48.2MB in the beginning and 87.3MB in the end (delta: -39.0MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,152 INFO L158 Benchmark]: IcfgBuilder took 1172.16ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 86.6MB in the beginning and 282.2MB in the end (delta: -195.6MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,152 INFO L158 Benchmark]: TraceAbstraction took 16554.42ms. Allocated memory was 327.2MB in the beginning and 780.1MB in the end (delta: 453.0MB). Free memory was 281.2MB in the beginning and 320.4MB in the end (delta: -39.2MB). Peak memory consumption was 483.2MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,152 INFO L158 Benchmark]: Witness Printer took 141.53ms. Allocated memory is still 780.1MB. Free memory was 320.4MB in the beginning and 307.8MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 10:32:36,153 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.85ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.25ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 65.1MB in the end (delta: 42.5MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.06ms. Allocated memory is still 142.6MB. Free memory was 65.1MB in the beginning and 48.2MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 148.60ms. Allocated memory is still 142.6MB. Free memory was 48.2MB in the beginning and 87.3MB in the end (delta: -39.0MB). Peak memory consumption was 30.1MB. Max. memory is 16.1GB. * IcfgBuilder took 1172.16ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 86.6MB in the beginning and 282.2MB in the end (delta: -195.6MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * TraceAbstraction took 16554.42ms. Allocated memory was 327.2MB in the beginning and 780.1MB in the end (delta: 453.0MB). Free memory was 281.2MB in the beginning and 320.4MB in the end (delta: -39.2MB). Peak memory consumption was 483.2MB. Max. memory is 16.1GB. * Witness Printer took 141.53ms. Allocated memory is still 780.1MB. Free memory was 320.4MB in the beginning and 307.8MB 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: 88]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 14, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2263 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2263 mSDsluCounter, 3191 SdHoareTripleChecker+Invalid, 7.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 327 mSDsCounter, 1577 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8110 IncrementalHoareTripleChecker+Invalid, 9687 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1577 mSolverCounterUnsat, 2864 mSDtfsCounter, 8110 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1018 GetRequests, 995 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15917occurred in iteration=13, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 3926 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 4978 NumberOfCodeBlocks, 4978 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4962 ConstructedInterpolants, 0 QuantifiedInterpolants, 14280 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1305 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 5289/5719 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((((((long long) a23 + 43) <= 0) && (a4 == 0)) || ((((10 <= a25) && (a4 == 0)) && (a23 <= 312)) && (246 <= a29))) || (((139 <= a23) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 12) && (a4 == 1)) && (a29 <= 130))) || ((a4 == 1) && (a25 == 10))) || (((a4 == 0) && (a29 <= 220)) && (a23 <= 312))) || ((141 <= a29) && (a4 == 1))) || (((a25 <= 10) && (a4 == 1)) && (a23 <= 312))) || (((a25 == 13) && (a4 == 0)) && (a23 <= 312))) || (((a4 == 0) && (a29 <= 220)) && (a25 == 10))) || ((a25 == 12) && (a4 == 0))) || (((a25 == 13) && (a4 == 1)) && (312 <= a23))) RESULT: Ultimate proved your program to be correct! [2025-03-03 10:32:36,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE