./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem10_label52.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/Problem10_label52.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 0085780b6a5384f0bbe6d5f11dabc3e1229a09ebe51547a1a74560868441797c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:49:42,962 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:49:43,016 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:43,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:49:43,022 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:49:43,043 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:49:43,044 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:49:43,044 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:49:43,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:49:43,044 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:49:43,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:49:43,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:49:43,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:49:43,045 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:49:43,045 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:49:43,047 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:43,047 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:49:43,047 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:49:43,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:49:43,048 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:49:43,048 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:49:43,048 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:49:43,048 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:49:43,048 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 -> 0085780b6a5384f0bbe6d5f11dabc3e1229a09ebe51547a1a74560868441797c [2025-03-16 14:49:43,278 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:49:43,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:49:43,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:49:43,289 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:49:43,290 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:49:43,291 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label52.c [2025-03-16 14:49:44,424 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9582978/8a4f9fc0df10473e9ccdb188fdcaec4a/FLAGe6309769c [2025-03-16 14:49:44,682 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:49:44,683 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label52.c [2025-03-16 14:49:44,698 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9582978/8a4f9fc0df10473e9ccdb188fdcaec4a/FLAGe6309769c [2025-03-16 14:49:44,988 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4a9582978/8a4f9fc0df10473e9ccdb188fdcaec4a [2025-03-16 14:49:44,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:49:44,991 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:49:44,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:44,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:49:44,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:49:44,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:44" (1/1) ... [2025-03-16 14:49:44,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dddc639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:44, skipping insertion in model container [2025-03-16 14:49:44,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:49:44" (1/1) ... [2025-03-16 14:49:45,016 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:49:45,138 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/Problem10_label52.c[4790,4803] [2025-03-16 14:49:45,230 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:45,236 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:49:45,250 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/Problem10_label52.c[4790,4803] [2025-03-16 14:49:45,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:49:45,307 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:49:45,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:45 WrapperNode [2025-03-16 14:49:45,308 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:49:45,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:45,309 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:49:45,309 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:49:45,313 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:45" (1/1) ... [2025-03-16 14:49:45,327 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:45" (1/1) ... [2025-03-16 14:49:45,358 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 595 [2025-03-16 14:49:45,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:49:45,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:49:45,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:49:45,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:49:45,367 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:45" (1/1) ... [2025-03-16 14:49:45,367 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:45" (1/1) ... [2025-03-16 14:49:45,375 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:45" (1/1) ... [2025-03-16 14:49:45,404 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:45,405 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:45" (1/1) ... [2025-03-16 14:49:45,405 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:45" (1/1) ... [2025-03-16 14:49:45,424 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:45" (1/1) ... [2025-03-16 14:49:45,427 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:45" (1/1) ... [2025-03-16 14:49:45,430 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:45" (1/1) ... [2025-03-16 14:49:45,432 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:45" (1/1) ... [2025-03-16 14:49:45,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:49:45,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:49:45,437 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:49:45,437 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:49:45,438 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:45" (1/1) ... [2025-03-16 14:49:45,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:49:45,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:45,465 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:45,470 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:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:49:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:49:45,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:49:45,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:49:45,537 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:49:45,539 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:49:46,312 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-16 14:49:46,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:49:46,324 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:49:46,326 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:49:46,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:46 BoogieIcfgContainer [2025-03-16 14:49:46,327 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:49:46,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:49:46,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:49:46,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:49:46,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:49:44" (1/3) ... [2025-03-16 14:49:46,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436c19bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:46, skipping insertion in model container [2025-03-16 14:49:46,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:49:45" (2/3) ... [2025-03-16 14:49:46,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@436c19bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:49:46, skipping insertion in model container [2025-03-16 14:49:46,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:49:46" (3/3) ... [2025-03-16 14:49:46,336 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label52.c [2025-03-16 14:49:46,371 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:49:46,372 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label52.c that has 1 procedures, 145 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:49:46,436 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:49:46,448 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;@325a821c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:49:46,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:49:46,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 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:46,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:49:46,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:46,458 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:46,458 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:46,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:46,463 INFO L85 PathProgramCache]: Analyzing trace with hash 841565366, now seen corresponding path program 1 times [2025-03-16 14:49:46,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039433862] [2025-03-16 14:49:46,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:46,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:46,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:49:46,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:49:46,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:46,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:46,587 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:46,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:46,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039433862] [2025-03-16 14:49:46,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039433862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:46,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:46,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346479995] [2025-03-16 14:49:46,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:46,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:49:46,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:46,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:49:46,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:49:46,616 INFO L87 Difference]: Start difference. First operand has 145 states, 143 states have (on average 1.972027972027972) internal successors, (282), 144 states have internal predecessors, (282), 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 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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:46,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:46,641 INFO L93 Difference]: Finished difference Result 289 states and 563 transitions. [2025-03-16 14:49:46,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:49:46,643 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2025-03-16 14:49:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:46,649 INFO L225 Difference]: With dead ends: 289 [2025-03-16 14:49:46,649 INFO L226 Difference]: Without dead ends: 142 [2025-03-16 14:49:46,652 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:46,654 INFO L435 NwaCegarLoop]: 220 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, 220 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:46,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 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:46,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-16 14:49:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2025-03-16 14:49:46,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 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:49:46,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2025-03-16 14:49:46,682 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 40 [2025-03-16 14:49:46,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:46,682 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2025-03-16 14:49:46,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 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:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2025-03-16 14:49:46,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-16 14:49:46,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:46,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:46,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:49:46,684 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:46,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:46,684 INFO L85 PathProgramCache]: Analyzing trace with hash -965160361, now seen corresponding path program 1 times [2025-03-16 14:49:46,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:46,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234424554] [2025-03-16 14:49:46,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:46,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:46,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-16 14:49:46,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-16 14:49:46,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:46,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:46,875 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:46,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:46,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234424554] [2025-03-16 14:49:46,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234424554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:46,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:46,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:46,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632711265] [2025-03-16 14:49:46,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:46,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:46,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:46,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:46,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:46,877 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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:47,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:47,358 INFO L93 Difference]: Finished difference Result 283 states and 433 transitions. [2025-03-16 14:49:47,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:47,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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 40 [2025-03-16 14:49:47,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:47,360 INFO L225 Difference]: With dead ends: 283 [2025-03-16 14:49:47,360 INFO L226 Difference]: Without dead ends: 281 [2025-03-16 14:49:47,360 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:49:47,361 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 143 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:47,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 10 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:49:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-16 14:49:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2025-03-16 14:49:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.5392857142857144) internal successors, (431), 280 states have internal predecessors, (431), 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:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 431 transitions. [2025-03-16 14:49:47,385 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 431 transitions. Word has length 40 [2025-03-16 14:49:47,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:47,385 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 431 transitions. [2025-03-16 14:49:47,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 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:47,385 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 431 transitions. [2025-03-16 14:49:47,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-16 14:49:47,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:47,388 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:49:47,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:47,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:47,390 INFO L85 PathProgramCache]: Analyzing trace with hash 320806193, now seen corresponding path program 1 times [2025-03-16 14:49:47,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:47,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36373595] [2025-03-16 14:49:47,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:47,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:47,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-16 14:49:47,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-16 14:49:47,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:47,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:47,587 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:47,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36373595] [2025-03-16 14:49:47,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36373595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:47,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:47,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:47,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276108065] [2025-03-16 14:49:47,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:47,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:47,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:47,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:47,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:47,590 INFO L87 Difference]: Start difference. First operand 281 states and 431 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:48,028 INFO L93 Difference]: Finished difference Result 700 states and 1075 transitions. [2025-03-16 14:49:48,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:48,029 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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 109 [2025-03-16 14:49:48,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:48,031 INFO L225 Difference]: With dead ends: 700 [2025-03-16 14:49:48,031 INFO L226 Difference]: Without dead ends: 420 [2025-03-16 14:49:48,032 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:49:48,032 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 109 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:48,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 33 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2025-03-16 14:49:48,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2025-03-16 14:49:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4200477326968974) internal successors, (595), 419 states have internal predecessors, (595), 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:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 595 transitions. [2025-03-16 14:49:48,051 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 595 transitions. Word has length 109 [2025-03-16 14:49:48,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:48,051 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 595 transitions. [2025-03-16 14:49:48,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 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:48,051 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 595 transitions. [2025-03-16 14:49:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-16 14:49:48,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:48,053 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 14:49:48,053 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:48,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:48,054 INFO L85 PathProgramCache]: Analyzing trace with hash 577885536, now seen corresponding path program 1 times [2025-03-16 14:49:48,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:48,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366179157] [2025-03-16 14:49:48,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:48,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:48,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-16 14:49:48,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-16 14:49:48,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:48,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:48,201 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:48,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:48,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366179157] [2025-03-16 14:49:48,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366179157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:48,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:48,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:48,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358533800] [2025-03-16 14:49:48,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:48,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:48,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:48,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:48,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:48,202 INFO L87 Difference]: Start difference. First operand 420 states and 595 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:48,594 INFO L93 Difference]: Finished difference Result 1256 states and 1782 transitions. [2025-03-16 14:49:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:48,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2025-03-16 14:49:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:48,599 INFO L225 Difference]: With dead ends: 1256 [2025-03-16 14:49:48,600 INFO L226 Difference]: Without dead ends: 837 [2025-03-16 14:49:48,601 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:49:48,604 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 108 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:48,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 203 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2025-03-16 14:49:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 698. [2025-03-16 14:49:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.3242467718794835) internal successors, (923), 697 states have internal predecessors, (923), 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:48,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 923 transitions. [2025-03-16 14:49:48,623 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 923 transitions. Word has length 115 [2025-03-16 14:49:48,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:48,623 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 923 transitions. [2025-03-16 14:49:48,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 923 transitions. [2025-03-16 14:49:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-16 14:49:48,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:48,625 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:49:48,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:48,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:48,626 INFO L85 PathProgramCache]: Analyzing trace with hash 708775535, now seen corresponding path program 1 times [2025-03-16 14:49:48,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:48,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887125051] [2025-03-16 14:49:48,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:48,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:48,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-16 14:49:48,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-16 14:49:48,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:48,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:48,749 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:48,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:48,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887125051] [2025-03-16 14:49:48,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887125051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:48,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:48,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994972964] [2025-03-16 14:49:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:48,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:48,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:48,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:48,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:48,750 INFO L87 Difference]: Start difference. First operand 698 states and 923 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:49,113 INFO L93 Difference]: Finished difference Result 1673 states and 2224 transitions. [2025-03-16 14:49:49,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:49,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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 126 [2025-03-16 14:49:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:49,116 INFO L225 Difference]: With dead ends: 1673 [2025-03-16 14:49:49,116 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 14:49:49,117 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:49:49,118 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 59 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:49,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 71 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:49,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 14:49:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 837. [2025-03-16 14:49:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.2165071770334928) internal successors, (1017), 836 states have internal predecessors, (1017), 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:49,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1017 transitions. [2025-03-16 14:49:49,131 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1017 transitions. Word has length 126 [2025-03-16 14:49:49,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:49,131 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1017 transitions. [2025-03-16 14:49:49,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 2 states have internal predecessors, (126), 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:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1017 transitions. [2025-03-16 14:49:49,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-16 14:49:49,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:49,133 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-03-16 14:49:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:49:49,134 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash 2078443733, now seen corresponding path program 1 times [2025-03-16 14:49:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77112576] [2025-03-16 14:49:49,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:49,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-16 14:49:49,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-16 14:49:49,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:49,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:49,463 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:49,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:49,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77112576] [2025-03-16 14:49:49,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77112576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:49,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:49,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:49,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391866947] [2025-03-16 14:49:49,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:49,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:49,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:49,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:49,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:49,465 INFO L87 Difference]: Start difference. First operand 837 states and 1017 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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:49,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:49,852 INFO L93 Difference]: Finished difference Result 1951 states and 2412 transitions. [2025-03-16 14:49:49,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:49,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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 192 [2025-03-16 14:49:49,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:49,857 INFO L225 Difference]: With dead ends: 1951 [2025-03-16 14:49:49,857 INFO L226 Difference]: Without dead ends: 1115 [2025-03-16 14:49:49,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:49:49,860 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 78 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:49,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 18 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:49,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-16 14:49:49,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1115. [2025-03-16 14:49:49,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.2351885098743267) internal successors, (1376), 1114 states have internal predecessors, (1376), 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:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1376 transitions. [2025-03-16 14:49:49,877 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1376 transitions. Word has length 192 [2025-03-16 14:49:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:49,877 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1376 transitions. [2025-03-16 14:49:49,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1376 transitions. [2025-03-16 14:49:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-16 14:49:49,879 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:49,879 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:49,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:49:49,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:49,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:49,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1119687447, now seen corresponding path program 1 times [2025-03-16 14:49:49,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:49,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266203609] [2025-03-16 14:49:49,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:49,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:49,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-16 14:49:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-16 14:49:49,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:49,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:50,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266203609] [2025-03-16 14:49:50,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266203609] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:50,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:50,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628952283] [2025-03-16 14:49:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:50,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:50,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:50,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:50,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:50,025 INFO L87 Difference]: Start difference. First operand 1115 states and 1376 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:50,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:50,385 INFO L93 Difference]: Finished difference Result 2507 states and 3110 transitions. [2025-03-16 14:49:50,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:50,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 200 [2025-03-16 14:49:50,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:50,390 INFO L225 Difference]: With dead ends: 2507 [2025-03-16 14:49:50,390 INFO L226 Difference]: Without dead ends: 1393 [2025-03-16 14:49:50,391 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:49:50,392 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 50 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:50,392 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 213 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-16 14:49:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2025-03-16 14:49:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.2170790103750997) internal successors, (1525), 1253 states have internal predecessors, (1525), 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:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1525 transitions. [2025-03-16 14:49:50,420 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1525 transitions. Word has length 200 [2025-03-16 14:49:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1525 transitions. [2025-03-16 14:49:50,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1525 transitions. [2025-03-16 14:49:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-16 14:49:50,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:50,424 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:49:50,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:49:50,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1235152052, now seen corresponding path program 1 times [2025-03-16 14:49:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633880438] [2025-03-16 14:49:50,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:50,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-16 14:49:50,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-16 14:49:50,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:50,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:50,623 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-16 14:49:50,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:50,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633880438] [2025-03-16 14:49:50,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633880438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:50,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:50,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:49:50,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272977806] [2025-03-16 14:49:50,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:50,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:50,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:50,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:50,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:50,624 INFO L87 Difference]: Start difference. First operand 1254 states and 1525 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:50,967 INFO L93 Difference]: Finished difference Result 2646 states and 3198 transitions. [2025-03-16 14:49:50,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:50,967 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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 209 [2025-03-16 14:49:50,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:50,971 INFO L225 Difference]: With dead ends: 2646 [2025-03-16 14:49:50,972 INFO L226 Difference]: Without dead ends: 1393 [2025-03-16 14:49:50,973 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:49:50,974 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 58 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:50,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 81 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-16 14:49:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2025-03-16 14:49:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1989942528735633) internal successors, (1669), 1392 states have internal predecessors, (1669), 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:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1669 transitions. [2025-03-16 14:49:51,002 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1669 transitions. Word has length 209 [2025-03-16 14:49:51,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:51,002 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1669 transitions. [2025-03-16 14:49:51,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 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:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1669 transitions. [2025-03-16 14:49:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2025-03-16 14:49:51,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:51,007 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:49:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:49:51,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:51,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1155954766, now seen corresponding path program 1 times [2025-03-16 14:49:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184620192] [2025-03-16 14:49:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:51,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:51,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-16 14:49:51,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-16 14:49:51,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:51,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:49:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184620192] [2025-03-16 14:49:51,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184620192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:51,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:51,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 14:49:51,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860400606] [2025-03-16 14:49:51,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:51,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-16 14:49:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:51,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-16 14:49:51,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:49:51,356 INFO L87 Difference]: Start difference. First operand 1393 states and 1669 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 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:51,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:51,881 INFO L93 Difference]: Finished difference Result 2701 states and 3248 transitions. [2025-03-16 14:49:51,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 14:49:51,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 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 252 [2025-03-16 14:49:51,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:51,886 INFO L225 Difference]: With dead ends: 2701 [2025-03-16 14:49:51,886 INFO L226 Difference]: Without dead ends: 1393 [2025-03-16 14:49:51,888 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:49:51,890 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 948 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:51,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 26 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 948 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 14:49:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-16 14:49:51,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1393. [2025-03-16 14:49:51,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1393 states, 1392 states have (on average 1.1939655172413792) internal successors, (1662), 1392 states have internal predecessors, (1662), 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:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1393 states to 1393 states and 1662 transitions. [2025-03-16 14:49:51,913 INFO L78 Accepts]: Start accepts. Automaton has 1393 states and 1662 transitions. Word has length 252 [2025-03-16 14:49:51,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:51,913 INFO L471 AbstractCegarLoop]: Abstraction has 1393 states and 1662 transitions. [2025-03-16 14:49:51,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 6 states have internal predecessors, (252), 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:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1393 states and 1662 transitions. [2025-03-16 14:49:51,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2025-03-16 14:49:51,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:51,916 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:51,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:49:51,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:51,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:51,918 INFO L85 PathProgramCache]: Analyzing trace with hash -361848872, now seen corresponding path program 1 times [2025-03-16 14:49:51,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:51,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395270084] [2025-03-16 14:49:51,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:51,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:51,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-16 14:49:51,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-16 14:49:51,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:51,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:52,223 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 41 proven. 36 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 14:49:52,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395270084] [2025-03-16 14:49:52,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395270084] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:49:52,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160560256] [2025-03-16 14:49:52,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:52,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:49:52,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:49:52,226 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:49:52,227 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:49:52,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes. [2025-03-16 14:49:52,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements. [2025-03-16 14:49:52,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:52,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:52,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:49:52,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:49:52,441 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-16 14:49:52,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:49:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160560256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:49:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-03-16 14:49:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749109655] [2025-03-16 14:49:52,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:52,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:52,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:52,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:49:52,443 INFO L87 Difference]: Start difference. First operand 1393 states and 1662 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:52,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:52,825 INFO L93 Difference]: Finished difference Result 2646 states and 3180 transitions. [2025-03-16 14:49:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:52,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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 288 [2025-03-16 14:49:52,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:52,830 INFO L225 Difference]: With dead ends: 2646 [2025-03-16 14:49:52,830 INFO L226 Difference]: Without dead ends: 1393 [2025-03-16 14:49:52,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-16 14:49:52,832 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 105 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:52,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 213 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 14:49:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2025-03-16 14:49:52,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2025-03-16 14:49:52,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1484437350359138) internal successors, (1439), 1253 states have internal predecessors, (1439), 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:52,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1439 transitions. [2025-03-16 14:49:52,856 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1439 transitions. Word has length 288 [2025-03-16 14:49:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:52,857 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1439 transitions. [2025-03-16 14:49:52,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 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:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1439 transitions. [2025-03-16 14:49:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2025-03-16 14:49:52,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:49:52,862 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:52,870 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:49:53,062 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:49:53,063 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:49:53,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:49:53,064 INFO L85 PathProgramCache]: Analyzing trace with hash -325818685, now seen corresponding path program 1 times [2025-03-16 14:49:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:49:53,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148920171] [2025-03-16 14:49:53,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:49:53,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:49:53,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes. [2025-03-16 14:49:53,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements. [2025-03-16 14:49:53,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:49:53,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:49:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2025-03-16 14:49:53,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:49:53,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148920171] [2025-03-16 14:49:53,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148920171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:49:53,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:49:53,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:49:53,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198104267] [2025-03-16 14:49:53,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:49:53,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:49:53,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:49:53,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:49:53,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:49:53,430 INFO L87 Difference]: Start difference. First operand 1254 states and 1439 transitions. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:53,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:49:53,794 INFO L93 Difference]: Finished difference Result 1671 states and 1890 transitions. [2025-03-16 14:49:53,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:49:53,794 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 339 [2025-03-16 14:49:53,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:49:53,795 INFO L225 Difference]: With dead ends: 1671 [2025-03-16 14:49:53,795 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 14:49:53,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:49:53,796 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 142 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 14:49:53,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 7 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 14:49:53,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 14:49:53,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 14:49:53,797 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:49:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 14:49:53,797 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 339 [2025-03-16 14:49:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:49:53,797 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 14:49:53,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:49:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 14:49:53,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 14:49:53,799 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 14:49:53,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:49:53,802 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:49:53,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 14:49:53,923 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 14:49:53,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 02:49:53 BoogieIcfgContainer [2025-03-16 14:49:53,936 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 14:49:53,937 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 14:49:53,937 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 14:49:53,937 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 14:49:53,937 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:46" (3/4) ... [2025-03-16 14:49:53,939 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 14:49:53,949 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 14:49:53,950 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 14:49:53,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 14:49:53,951 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 14:49:54,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 14:49:54,041 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 14:49:54,041 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 14:49:54,042 INFO L158 Benchmark]: Toolchain (without parser) took 9051.39ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 111.7MB in the beginning and 206.6MB in the end (delta: -94.8MB). Peak memory consumption was 55.0MB. Max. memory is 16.1GB. [2025-03-16 14:49:54,042 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:49:54,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.30ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 84.1MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-16 14:49:54,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.37ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 76.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:54,043 INFO L158 Benchmark]: Boogie Preprocessor took 77.61ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 67.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:54,043 INFO L158 Benchmark]: IcfgBuilder took 890.25ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 50.4MB in the end (delta: 17.4MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2025-03-16 14:49:54,043 INFO L158 Benchmark]: TraceAbstraction took 7607.04ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 49.7MB in the beginning and 218.1MB in the end (delta: -168.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 14:49:54,043 INFO L158 Benchmark]: Witness Printer took 104.64ms. Allocated memory is still 293.6MB. Free memory was 218.1MB in the beginning and 206.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 14:49:54,044 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.23ms. Allocated memory is still 201.3MB. Free memory is still 122.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.30ms. Allocated memory is still 142.6MB. Free memory was 111.7MB in the beginning and 84.1MB in the end (delta: 27.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.37ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 76.7MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.61ms. Allocated memory is still 142.6MB. Free memory was 76.7MB in the beginning and 67.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 890.25ms. Allocated memory is still 142.6MB. Free memory was 67.8MB in the beginning and 50.4MB in the end (delta: 17.4MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 7607.04ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 49.7MB in the beginning and 218.1MB in the end (delta: -168.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 104.64ms. Allocated memory is still 293.6MB. Free memory was 218.1MB in the beginning and 206.6MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 137]: 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, 145 locations, 282 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 994 mSDsluCounter, 1095 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4128 IncrementalHoareTripleChecker+Invalid, 4665 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 537 mSolverCounterUnsat, 1044 mSDtfsCounter, 4128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 325 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 556 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 2198 NumberOfCodeBlocks, 2198 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2186 ConstructedInterpolants, 0 QuantifiedInterpolants, 6568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 394 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 1417/1453 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: 592]: Location Invariant Derived location invariant: ((((((((a19 <= 9) && (a19 != 8)) && (14 == a4)) && (a12 == 0)) || ((((a19 <= 9) && (4 <= a10)) && (14 == a4)) && (a12 == 0))) || ((((a19 <= 9) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || (((a10 <= 0) && (14 == a4)) && (a12 == 0))) || (((a10 == 1) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2025-03-16 14:49:54,056 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