./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label03.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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_label03.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 17c92e2f7b920672487a7c33b9216e5136ad737688964579812bc0c782959b18 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:49:55,426 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:49:55,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:49:55,484 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:49:55,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:49:55,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:49:55,502 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:49:55,502 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:49:55,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:49:55,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:49:55,502 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:49:55,502 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:49:55,503 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:55,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:49:55,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:49:55,504 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:49:55,504 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 -> 17c92e2f7b920672487a7c33b9216e5136ad737688964579812bc0c782959b18 [2025-03-16 14:49:55,703 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:49:55,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:49:55,712 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:49:55,712 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:49:55,713 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:49:55,714 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label03.c [2025-03-16 14:49:56,823 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be510200e/5e92a998456245c7817753deb6b00b36/FLAGb017262ce [2025-03-16 14:49:57,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:49:57,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label03.c [2025-03-16 14:49:57,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be510200e/5e92a998456245c7817753deb6b00b36/FLAGb017262ce [2025-03-16 14:49:57,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be510200e/5e92a998456245c7817753deb6b00b36 [2025-03-16 14:49:57,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:49:57,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:49:57,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:57,185 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:49:57,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:49:57,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2c1058 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57, skipping insertion in model container [2025-03-16 14:49:57,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:49:57,364 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_label03.c[4398,4411] [2025-03-16 14:49:57,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:57,517 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:49:57,535 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_label03.c[4398,4411] [2025-03-16 14:49:57,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:57,616 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:49:57,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57 WrapperNode [2025-03-16 14:49:57,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:57,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:57,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:49:57,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:49:57,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,644 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,704 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-03-16 14:49:57,705 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:57,705 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:49:57,706 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:49:57,706 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:49:57,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,732 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,764 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-16 14:49:57,764 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,765 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,827 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:49:57,848 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:49:57,848 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:49:57,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:49:57,849 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (1/1) ... [2025-03-16 14:49:57,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:57,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:57,875 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-16 14:49:57,910 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-16 14:49:57,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:49:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:49:57,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:49:57,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:49:57,985 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:49:57,987 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:49:59,203 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-03-16 14:49:59,203 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:49:59,212 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:49:59,215 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:49:59,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:59 BoogieIcfgContainer [2025-03-16 14:49:59,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:49:59,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:49:59,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:49:59,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:49:59,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:49:57" (1/3) ... [2025-03-16 14:49:59,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d72e1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:59, skipping insertion in model container [2025-03-16 14:49:59,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:57" (2/3) ... [2025-03-16 14:49:59,222 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d72e1e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:59, skipping insertion in model container [2025-03-16 14:49:59,222 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:59" (3/3) ... [2025-03-16 14:49:59,223 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label03.c [2025-03-16 14:49:59,235 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:49:59,236 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label03.c that has 1 procedures, 222 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:49:59,284 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:49:59,293 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;@6a87bcb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:49:59,294 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:49:59,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 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-16 14:49:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 14:49:59,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:59,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:59,305 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash -516783390, now seen corresponding path program 1 times [2025-03-16 14:49:59,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:59,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201971313] [2025-03-16 14:49:59,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:59,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:59,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 14:49:59,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 14:49:59,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:59,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:59,419 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-16 14:49:59,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:59,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201971313] [2025-03-16 14:49:59,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201971313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:59,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:59,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:59,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057681799] [2025-03-16 14:49:59,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:59,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:49:59,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:59,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:49:59,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:59,441 INFO L87 Difference]: Start difference. First operand has 222 states, 220 states have (on average 1.9090909090909092) internal successors, (420), 221 states have internal predecessors, (420), 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 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-16 14:49:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:59,466 INFO L93 Difference]: Finished difference Result 443 states and 839 transitions. [2025-03-16 14:49:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:49:59,467 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2025-03-16 14:49:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:59,472 INFO L225 Difference]: With dead ends: 443 [2025-03-16 14:49:59,472 INFO L226 Difference]: Without dead ends: 219 [2025-03-16 14:49:59,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:59,476 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:59,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:49:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-03-16 14:49:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2025-03-16 14:49:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.628440366972477) internal successors, (355), 218 states have internal predecessors, (355), 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-16 14:49:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 355 transitions. [2025-03-16 14:49:59,503 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 355 transitions. Word has length 29 [2025-03-16 14:49:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:59,504 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 355 transitions. [2025-03-16 14:49:59,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 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-16 14:49:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 355 transitions. [2025-03-16 14:49:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 14:49:59,504 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:59,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:59,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:49:59,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:59,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1887090565, now seen corresponding path program 1 times [2025-03-16 14:49:59,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:59,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648844624] [2025-03-16 14:49:59,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:59,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:59,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-16 14:49:59,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 14:49:59,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:59,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:59,652 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-16 14:49:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648844624] [2025-03-16 14:49:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648844624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479494722] [2025-03-16 14:49:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:59,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:59,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:59,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:59,656 INFO L87 Difference]: Start difference. First operand 219 states and 355 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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-16 14:50:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:00,443 INFO L93 Difference]: Finished difference Result 639 states and 1042 transitions. [2025-03-16 14:50:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 29 [2025-03-16 14:50:00,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:00,447 INFO L225 Difference]: With dead ends: 639 [2025-03-16 14:50:00,448 INFO L226 Difference]: Without dead ends: 421 [2025-03-16 14:50:00,449 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-16 14:50:00,450 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 182 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:00,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-16 14:50:00,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-16 14:50:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 411. [2025-03-16 14:50:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.524390243902439) internal successors, (625), 410 states have internal predecessors, (625), 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-16 14:50:00,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2025-03-16 14:50:00,470 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 29 [2025-03-16 14:50:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:00,470 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2025-03-16 14:50:00,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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-16 14:50:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2025-03-16 14:50:00,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-16 14:50:00,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:00,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:00,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:50:00,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:00,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:00,473 INFO L85 PathProgramCache]: Analyzing trace with hash -2098042403, now seen corresponding path program 1 times [2025-03-16 14:50:00,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:00,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607747341] [2025-03-16 14:50:00,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:00,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-16 14:50:00,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-16 14:50:00,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:00,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:00,669 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:00,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:00,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607747341] [2025-03-16 14:50:00,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607747341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:00,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:00,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:00,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631176423] [2025-03-16 14:50:00,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:00,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:00,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:00,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:00,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:00,670 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-16 14:50:01,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:01,345 INFO L93 Difference]: Finished difference Result 1198 states and 1828 transitions. [2025-03-16 14:50:01,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:01,351 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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 95 [2025-03-16 14:50:01,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:01,355 INFO L225 Difference]: With dead ends: 1198 [2025-03-16 14:50:01,355 INFO L226 Difference]: Without dead ends: 788 [2025-03-16 14:50:01,356 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-16 14:50:01,357 INFO L435 NwaCegarLoop]: 146 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, 175 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-16 14:50:01,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 175 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-16 14:50:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2025-03-16 14:50:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.3748411689961881) internal successors, (1082), 787 states have internal predecessors, (1082), 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-16 14:50:01,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1082 transitions. [2025-03-16 14:50:01,381 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1082 transitions. Word has length 95 [2025-03-16 14:50:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:01,382 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1082 transitions. [2025-03-16 14:50:01,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 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-16 14:50:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1082 transitions. [2025-03-16 14:50:01,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-16 14:50:01,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:01,385 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:01,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:50:01,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:01,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1694368339, now seen corresponding path program 1 times [2025-03-16 14:50:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:01,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956942654] [2025-03-16 14:50:01,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:01,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:01,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-16 14:50:01,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-16 14:50:01,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:01,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:01,624 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:01,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:01,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956942654] [2025-03-16 14:50:01,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956942654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:01,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:01,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:50:01,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884030057] [2025-03-16 14:50:01,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:01,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:01,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:01,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:01,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:01,625 INFO L87 Difference]: Start difference. First operand 788 states and 1082 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-16 14:50:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:02,221 INFO L93 Difference]: Finished difference Result 2315 states and 3181 transitions. [2025-03-16 14:50:02,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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 99 [2025-03-16 14:50:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:02,227 INFO L225 Difference]: With dead ends: 2315 [2025-03-16 14:50:02,227 INFO L226 Difference]: Without dead ends: 1528 [2025-03-16 14:50:02,228 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-16 14:50:02,229 INFO L435 NwaCegarLoop]: 169 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, 193 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-16 14:50:02,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 193 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:02,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2025-03-16 14:50:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1525. [2025-03-16 14:50:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1525 states, 1524 states have (on average 1.2178477690288714) internal successors, (1856), 1524 states have internal predecessors, (1856), 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-16 14:50:02,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1525 states to 1525 states and 1856 transitions. [2025-03-16 14:50:02,261 INFO L78 Accepts]: Start accepts. Automaton has 1525 states and 1856 transitions. Word has length 99 [2025-03-16 14:50:02,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:02,261 INFO L471 AbstractCegarLoop]: Abstraction has 1525 states and 1856 transitions. [2025-03-16 14:50:02,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 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-16 14:50:02,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1525 states and 1856 transitions. [2025-03-16 14:50:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 14:50:02,268 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:02,268 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:02,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:50:02,269 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:02,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:02,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1617673556, now seen corresponding path program 1 times [2025-03-16 14:50:02,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:02,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499865071] [2025-03-16 14:50:02,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:02,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:02,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 14:50:02,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 14:50:02,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:02,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:02,464 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:02,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:02,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499865071] [2025-03-16 14:50:02,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499865071] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:02,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:02,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:02,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828636492] [2025-03-16 14:50:02,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:02,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:02,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:02,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:02,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:02,466 INFO L87 Difference]: Start difference. First operand 1525 states and 1856 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-16 14:50:03,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:03,097 INFO L93 Difference]: Finished difference Result 3256 states and 4124 transitions. [2025-03-16 14:50:03,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:03,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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 156 [2025-03-16 14:50:03,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:03,103 INFO L225 Difference]: With dead ends: 3256 [2025-03-16 14:50:03,104 INFO L226 Difference]: Without dead ends: 1916 [2025-03-16 14:50:03,105 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-16 14:50:03,105 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 205 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 320 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-16 14:50:03,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1916 states. [2025-03-16 14:50:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1916 to 1913. [2025-03-16 14:50:03,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1912 states have (on average 1.2468619246861925) internal successors, (2384), 1912 states have internal predecessors, (2384), 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-16 14:50:03,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2384 transitions. [2025-03-16 14:50:03,132 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2384 transitions. Word has length 156 [2025-03-16 14:50:03,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:03,133 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2384 transitions. [2025-03-16 14:50:03,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 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-16 14:50:03,133 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2384 transitions. [2025-03-16 14:50:03,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-03-16 14:50:03,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:03,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:03,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:50:03,137 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:03,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:03,138 INFO L85 PathProgramCache]: Analyzing trace with hash 405855470, now seen corresponding path program 1 times [2025-03-16 14:50:03,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:03,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505512199] [2025-03-16 14:50:03,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:03,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-03-16 14:50:03,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-03-16 14:50:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 14:50:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:03,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505512199] [2025-03-16 14:50:03,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505512199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:03,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:03,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:03,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625889923] [2025-03-16 14:50:03,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:03,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:03,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:03,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:03,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:03,335 INFO L87 Difference]: Start difference. First operand 1913 states and 2384 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-16 14:50:03,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:03,984 INFO L93 Difference]: Finished difference Result 4388 states and 5591 transitions. [2025-03-16 14:50:03,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:03,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 211 [2025-03-16 14:50:03,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:03,993 INFO L225 Difference]: With dead ends: 4388 [2025-03-16 14:50:03,993 INFO L226 Difference]: Without dead ends: 2660 [2025-03-16 14:50:03,995 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-16 14:50:03,995 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 167 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:03,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 390 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:03,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states. [2025-03-16 14:50:04,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2466. [2025-03-16 14:50:04,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2465 states have (on average 1.2352941176470589) internal successors, (3045), 2465 states have internal predecessors, (3045), 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-16 14:50:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3045 transitions. [2025-03-16 14:50:04,030 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3045 transitions. Word has length 211 [2025-03-16 14:50:04,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:04,031 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3045 transitions. [2025-03-16 14:50:04,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-16 14:50:04,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3045 transitions. [2025-03-16 14:50:04,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-03-16 14:50:04,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:04,033 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:04,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:50:04,033 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:04,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:04,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1784415071, now seen corresponding path program 1 times [2025-03-16 14:50:04,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:04,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16989467] [2025-03-16 14:50:04,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:04,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:04,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-03-16 14:50:04,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-03-16 14:50:04,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:04,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:04,156 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:50:04,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:04,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16989467] [2025-03-16 14:50:04,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16989467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:04,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:04,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:04,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288874293] [2025-03-16 14:50:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:04,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:04,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:04,157 INFO L87 Difference]: Start difference. First operand 2466 states and 3045 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-16 14:50:04,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:04,817 INFO L93 Difference]: Finished difference Result 6408 states and 8062 transitions. [2025-03-16 14:50:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:04,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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 217 [2025-03-16 14:50:04,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:04,828 INFO L225 Difference]: With dead ends: 6408 [2025-03-16 14:50:04,828 INFO L226 Difference]: Without dead ends: 3943 [2025-03-16 14:50:04,831 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-16 14:50:04,832 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 200 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:04,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 269 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:04,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3943 states. [2025-03-16 14:50:04,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3943 to 3940. [2025-03-16 14:50:04,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3940 states, 3939 states have (on average 1.2322924600152323) internal successors, (4854), 3939 states have internal predecessors, (4854), 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-16 14:50:04,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 4854 transitions. [2025-03-16 14:50:04,885 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 4854 transitions. Word has length 217 [2025-03-16 14:50:04,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:04,885 INFO L471 AbstractCegarLoop]: Abstraction has 3940 states and 4854 transitions. [2025-03-16 14:50:04,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 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-16 14:50:04,886 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 4854 transitions. [2025-03-16 14:50:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2025-03-16 14:50:04,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:04,889 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:04,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:50:04,889 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:04,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:04,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1784571252, now seen corresponding path program 1 times [2025-03-16 14:50:04,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:04,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748887840] [2025-03-16 14:50:04,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:04,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:04,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes. [2025-03-16 14:50:04,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements. [2025-03-16 14:50:04,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:04,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:05,119 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:50:05,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:05,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748887840] [2025-03-16 14:50:05,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748887840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:05,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:05,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:05,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763104597] [2025-03-16 14:50:05,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:05,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:50:05,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:05,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:50:05,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:50:05,122 INFO L87 Difference]: Start difference. First operand 3940 states and 4854 transitions. Second operand has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 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-16 14:50:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:06,135 INFO L93 Difference]: Finished difference Result 12153 states and 15361 transitions. [2025-03-16 14:50:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:50:06,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 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 256 [2025-03-16 14:50:06,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:06,160 INFO L225 Difference]: With dead ends: 12153 [2025-03-16 14:50:06,160 INFO L226 Difference]: Without dead ends: 8398 [2025-03-16 14:50:06,166 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-16 14:50:06,167 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 263 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:06,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 95 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-16 14:50:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8398 states. [2025-03-16 14:50:06,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8398 to 8394. [2025-03-16 14:50:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8394 states, 8393 states have (on average 1.2447277493149054) internal successors, (10447), 8393 states have internal predecessors, (10447), 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-16 14:50:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8394 states to 8394 states and 10447 transitions. [2025-03-16 14:50:06,323 INFO L78 Accepts]: Start accepts. Automaton has 8394 states and 10447 transitions. Word has length 256 [2025-03-16 14:50:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:06,324 INFO L471 AbstractCegarLoop]: Abstraction has 8394 states and 10447 transitions. [2025-03-16 14:50:06,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.0) internal successors, (256), 3 states have internal predecessors, (256), 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-16 14:50:06,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8394 states and 10447 transitions. [2025-03-16 14:50:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-16 14:50:06,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:06,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:06,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:50:06,330 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:06,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:06,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1729775845, now seen corresponding path program 1 times [2025-03-16 14:50:06,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:06,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326155768] [2025-03-16 14:50:06,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:06,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:06,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-03-16 14:50:06,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-03-16 14:50:06,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:06,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-16 14:50:06,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:06,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326155768] [2025-03-16 14:50:06,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326155768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:06,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:06,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:06,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299221072] [2025-03-16 14:50:06,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:06,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:06,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:06,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:06,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:06,577 INFO L87 Difference]: Start difference. First operand 8394 states and 10447 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-16 14:50:07,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:07,230 INFO L93 Difference]: Finished difference Result 17333 states and 21901 transitions. [2025-03-16 14:50:07,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:07,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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 265 [2025-03-16 14:50:07,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:07,263 INFO L225 Difference]: With dead ends: 17333 [2025-03-16 14:50:07,263 INFO L226 Difference]: Without dead ends: 10234 [2025-03-16 14:50:07,274 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-16 14:50:07,276 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 192 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:07,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 151 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:07,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10234 states. [2025-03-16 14:50:07,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10234 to 10234. [2025-03-16 14:50:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10234 states, 10233 states have (on average 1.2205609303234632) internal successors, (12490), 10233 states have internal predecessors, (12490), 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-16 14:50:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10234 states to 10234 states and 12490 transitions. [2025-03-16 14:50:07,439 INFO L78 Accepts]: Start accepts. Automaton has 10234 states and 12490 transitions. Word has length 265 [2025-03-16 14:50:07,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:07,440 INFO L471 AbstractCegarLoop]: Abstraction has 10234 states and 12490 transitions. [2025-03-16 14:50:07,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 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-16 14:50:07,440 INFO L276 IsEmpty]: Start isEmpty. Operand 10234 states and 12490 transitions. [2025-03-16 14:50:07,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-16 14:50:07,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:07,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:07,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:50:07,447 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:07,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1490514420, now seen corresponding path program 1 times [2025-03-16 14:50:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153118213] [2025-03-16 14:50:07,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:07,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:07,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 14:50:07,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 14:50:07,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:07,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 14:50:07,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153118213] [2025-03-16 14:50:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153118213] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244748391] [2025-03-16 14:50:07,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:07,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:07,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:07,790 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-16 14:50:07,791 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-16 14:50:07,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-16 14:50:07,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-16 14:50:07,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:07,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:07,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:50:07,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:08,176 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 14:50:08,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:50:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-16 14:50:08,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244748391] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:08,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:50:08,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 14:50:08,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855537720] [2025-03-16 14:50:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:08,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:08,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:08,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:08,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:08,248 INFO L87 Difference]: Start difference. First operand 10234 states and 12490 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:08,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:08,918 INFO L93 Difference]: Finished difference Result 21198 states and 26244 transitions. [2025-03-16 14:50:08,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:08,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 267 [2025-03-16 14:50:08,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:08,937 INFO L225 Difference]: With dead ends: 21198 [2025-03-16 14:50:08,937 INFO L226 Difference]: Without dead ends: 12259 [2025-03-16 14:50:08,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 535 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:50:08,945 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 205 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:08,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 134 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:08,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12259 states. [2025-03-16 14:50:09,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12259 to 11707. [2025-03-16 14:50:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11707 states, 11706 states have (on average 1.2194601059285837) internal successors, (14275), 11706 states have internal predecessors, (14275), 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-16 14:50:09,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11707 states to 11707 states and 14275 transitions. [2025-03-16 14:50:09,073 INFO L78 Accepts]: Start accepts. Automaton has 11707 states and 14275 transitions. Word has length 267 [2025-03-16 14:50:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:09,073 INFO L471 AbstractCegarLoop]: Abstraction has 11707 states and 14275 transitions. [2025-03-16 14:50:09,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:50:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 11707 states and 14275 transitions. [2025-03-16 14:50:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-03-16 14:50:09,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:09,079 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:09,086 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-16 14:50:09,280 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,SelfDestructingSolverStorable9 [2025-03-16 14:50:09,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:09,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1080459741, now seen corresponding path program 1 times [2025-03-16 14:50:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:09,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068698030] [2025-03-16 14:50:09,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:09,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-16 14:50:09,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-16 14:50:09,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:09,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 108 proven. 122 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:50:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:09,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068698030] [2025-03-16 14:50:09,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068698030] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:50:09,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867846797] [2025-03-16 14:50:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:09,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:50:09,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:50:09,607 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-16 14:50:09,608 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-16 14:50:09,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-03-16 14:50:09,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-03-16 14:50:09,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:09,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:09,719 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:50:09,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:50:09,809 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-03-16 14:50:09,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:50:09,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867846797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:09,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:50:09,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:50:09,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115988556] [2025-03-16 14:50:09,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:09,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:09,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:09,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:09,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:50:09,811 INFO L87 Difference]: Start difference. First operand 11707 states and 14275 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-16 14:50:10,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:10,501 INFO L93 Difference]: Finished difference Result 29483 states and 36154 transitions. [2025-03-16 14:50:10,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:10,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 291 [2025-03-16 14:50:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:10,533 INFO L225 Difference]: With dead ends: 29483 [2025-03-16 14:50:10,533 INFO L226 Difference]: Without dead ends: 18515 [2025-03-16 14:50:10,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:50:10,547 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 143 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:10,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 129 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 14:50:10,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18515 states. [2025-03-16 14:50:10,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18515 to 18515. [2025-03-16 14:50:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18515 states, 18514 states have (on average 1.1948255374311332) internal successors, (22121), 18514 states have internal predecessors, (22121), 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-16 14:50:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18515 states to 18515 states and 22121 transitions. [2025-03-16 14:50:10,804 INFO L78 Accepts]: Start accepts. Automaton has 18515 states and 22121 transitions. Word has length 291 [2025-03-16 14:50:10,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:10,804 INFO L471 AbstractCegarLoop]: Abstraction has 18515 states and 22121 transitions. [2025-03-16 14:50:10,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-16 14:50:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 18515 states and 22121 transitions. [2025-03-16 14:50:10,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-16 14:50:10,812 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:10,812 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:10,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:50:11,012 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,SelfDestructingSolverStorable10 [2025-03-16 14:50:11,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:11,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:11,014 INFO L85 PathProgramCache]: Analyzing trace with hash -1864610597, now seen corresponding path program 1 times [2025-03-16 14:50:11,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:11,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54256575] [2025-03-16 14:50:11,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:11,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-03-16 14:50:11,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-03-16 14:50:11,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:11,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-16 14:50:11,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54256575] [2025-03-16 14:50:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54256575] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697709656] [2025-03-16 14:50:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:11,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:11,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:11,166 INFO L87 Difference]: Start difference. First operand 18515 states and 22121 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-16 14:50:11,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:11,750 INFO L93 Difference]: Finished difference Result 34046 states and 40562 transitions. [2025-03-16 14:50:11,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:11,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 310 [2025-03-16 14:50:11,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:11,776 INFO L225 Difference]: With dead ends: 34046 [2025-03-16 14:50:11,776 INFO L226 Difference]: Without dead ends: 16453 [2025-03-16 14:50:11,790 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-16 14:50:11,791 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 139 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:11,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 148 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:11,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16453 states. [2025-03-16 14:50:11,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16453 to 12953. [2025-03-16 14:50:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12953 states, 12952 states have (on average 1.1559604694255714) internal successors, (14972), 12952 states have internal predecessors, (14972), 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-16 14:50:11,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12953 states to 12953 states and 14972 transitions. [2025-03-16 14:50:11,931 INFO L78 Accepts]: Start accepts. Automaton has 12953 states and 14972 transitions. Word has length 310 [2025-03-16 14:50:11,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:11,931 INFO L471 AbstractCegarLoop]: Abstraction has 12953 states and 14972 transitions. [2025-03-16 14:50:11,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-16 14:50:11,932 INFO L276 IsEmpty]: Start isEmpty. Operand 12953 states and 14972 transitions. [2025-03-16 14:50:11,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-03-16 14:50:11,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:50:11,941 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:11,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 14:50:11,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:50:11,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:50:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1224569751, now seen corresponding path program 1 times [2025-03-16 14:50:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:50:11,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551382325] [2025-03-16 14:50:11,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:50:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:50:11,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-03-16 14:50:11,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-03-16 14:50:11,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:50:11,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:50:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2025-03-16 14:50:12,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:50:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551382325] [2025-03-16 14:50:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551382325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:50:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:50:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:50:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908154142] [2025-03-16 14:50:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:50:12,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:50:12,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:50:12,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:50:12,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:12,109 INFO L87 Difference]: Start difference. First operand 12953 states and 14972 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-16 14:50:12,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:50:12,696 INFO L93 Difference]: Finished difference Result 27569 states and 31973 transitions. [2025-03-16 14:50:12,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:50:12,697 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 333 [2025-03-16 14:50:12,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:50:12,698 INFO L225 Difference]: With dead ends: 27569 [2025-03-16 14:50:12,698 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:50:12,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:50:12,710 INFO L435 NwaCegarLoop]: 307 mSDtfsCounter, 175 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:50:12,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 324 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:50:12,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:50:12,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:50:12,711 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-16 14:50:12,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:50:12,711 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 333 [2025-03-16 14:50:12,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:50:12,711 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:50:12,711 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-16 14:50:12,711 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:50:12,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:50:12,713 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:50:12,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:50:12,715 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:50:12,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:50:13,542 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:50:13,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:50:13 BoogieIcfgContainer [2025-03-16 14:50:13,553 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:50:13,553 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:50:13,553 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:50:13,553 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:50:13,554 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:59" (3/4) ... [2025-03-16 14:50:13,555 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:50:13,575 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:50:13,576 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:50:13,577 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:50:13,578 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:50:13,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:50:13,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:50:13,700 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:50:13,702 INFO L158 Benchmark]: Toolchain (without parser) took 16517.06ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 130.2MB in the beginning and 451.1MB in the end (delta: -320.9MB). Peak memory consumption was 411.9MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,702 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:50:13,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 433.89ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 87.4MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.30ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 70.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,702 INFO L158 Benchmark]: Boogie Preprocessor took 141.54ms. Allocated memory is still 167.8MB. Free memory was 70.6MB in the beginning and 47.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,703 INFO L158 Benchmark]: IcfgBuilder took 1368.22ms. Allocated memory is still 167.8MB. Free memory was 47.2MB in the beginning and 111.2MB in the end (delta: -64.1MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,703 INFO L158 Benchmark]: TraceAbstraction took 14335.42ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 111.2MB in the beginning and 139.7MB in the end (delta: -28.5MB). Peak memory consumption was 396.1MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,703 INFO L158 Benchmark]: Witness Printer took 146.71ms. Allocated memory is still 570.4MB. Free memory was 139.7MB in the beginning and 451.1MB in the end (delta: -311.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 14:50:13,704 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.55ms. Allocated memory is still 201.3MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 433.89ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 87.4MB in the end (delta: 42.8MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.30ms. Allocated memory is still 167.8MB. Free memory was 87.4MB in the beginning and 70.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.54ms. Allocated memory is still 167.8MB. Free memory was 70.6MB in the beginning and 47.2MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1368.22ms. Allocated memory is still 167.8MB. Free memory was 47.2MB in the beginning and 111.2MB in the end (delta: -64.1MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 14335.42ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 111.2MB in the beginning and 139.7MB in the end (delta: -28.5MB). Peak memory consumption was 396.1MB. Max. memory is 16.1GB. * Witness Printer took 146.71ms. Allocated memory is still 570.4MB. Free memory was 139.7MB in the beginning and 451.1MB in the end (delta: -311.4MB). 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: 106]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 222 locations, 420 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.4s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2148 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2148 mSDsluCounter, 2808 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 293 mSDsCounter, 1470 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6967 IncrementalHoareTripleChecker+Invalid, 8437 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1470 mSolverCounterUnsat, 2515 mSDtfsCounter, 6967 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 858 GetRequests, 840 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18515occurred in iteration=11, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 4269 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3116 NumberOfCodeBlocks, 3116 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3367 ConstructedInterpolants, 0 QuantifiedInterpolants, 8584 SizeOfPredicates, 0 NumberOfNonLiveVariables, 800 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 2190/2422 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Location Invariant Derived location invariant: (((((((((((a25 == 12) && (a4 == 1)) && (a29 <= 130)) || (((a29 <= 245) && (141 <= a29)) && (a4 == 1))) || (((a25 == 11) && (141 <= a29)) && (a4 == 1))) || (((a4 == 0) && (a25 <= 10)) && (a29 <= 245))) || ((a4 == 1) && (0 <= ((long long) a23 + 42)))) || (((a25 == 12) && (141 <= a29)) && (a4 == 1))) || ((a25 == 12) && (a4 == 0))) || ((a4 == 0) && (a23 <= 312))) || ((a25 <= 10) && (a4 == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:50:13,720 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